This paper analyses, models mathematically, and compares national voting behaviours across seven democratic countries that have a long term election history, focusing on re-election rates, leaders’ reputation with voters and the importance of friends’ and family influence. Based on the data,...

We analyze emotionally annotated massive data from Internet relay chat (IRC) as well as from BBC forum website and model the dialogues between chat participants by assuming that the driving force for the discussion is the entropy growth of emotional probability distribution. This process is...

The 1995 model of Bonabeau et al. is generalized by giving each individual a different ability to win or lose a fight. We also introduce different groups such that the losers of fights between different groups are eliminated. The overall phase diagram for the first-order transition between...

We study the Brazilian Popular Music in a network perspective. We call the Brazilian Popular Music Network, BPMN, the graph where the vertices are the song writers and the links are determined by the existence of at least a common singer. The linking degree distribution of such graph shows power...

The 1995 model of Bonabeau et al. explains the emergence of social hierarchies through randomness, but gives as many leaders as followers. A simple modification allows a more realistic asymmetry with far fewer leaders.

Since its introduction in 2000, the Sznajd model has been assumed to simulate a democratic community with two parties. The main flaw in this model is that a Sznajd system freezes in the long term in a non-democratic state, which can be either a dictatorship or a stalemate configuration. Here we...

The traditional Sznajd model, as well as its Ochrombel simplification, for opinion spreading are modified to have a convincing strength proportional to a negative power of the spatial distance. We find the usual phase transition in the full Sznajd model, but not in the Ochrombel simplification....

An analytical approach to network dynamics is used to show that when agents copy their state randomly, the network arrives to a stationary regime in which the distribution of states is independent of the degree. The effects of network topology on the process are characterized introducing a...