Evolution of ethnocentrism on undirected and directed Barabási-Albert networks
arXiv:0905.2672 · doi:10.1016/j.physa.2009.08.029
Abstract
Using Monte Carlo simulations, we study the evolution of contigent cooperation and ethnocentrism in the one-move game. Interactions and reproduction among computational agents are simulated on {\it undirected} and {\it directed} Barabási-Albert (BA) networks. We first replicate the Hammond-Axelrod model of in-group favoritism on a square lattice and then generalize this model on {\it undirected} and {\it directed} BA networks for both asexual and sexual reproduction cases. Our simulations demonstrate that irrespective of the mode of reproduction, ethnocentric strategy becomes common even though cooperation is individually costly and mechanisms such as reciprocity or conformity are absent. Moreover, our results indicate that the spread of favoritism toward similar others highly depends on the network topology and the associated heterogeneity of the studied population.
12 pages, 6 figures
References in corpus (8)
- Statistical physics of social dynamics
- Directed network modules
- Competitive cluster growth in complex networks
- Reciprocity and the Emergence of Power Laws in Social Networks
- Boundary effects in a three-state modified voter model for languages
- Simulation of majority rule disturbed by power-law noise on directed and undirected Barabasi-Albert networks
- Persistence in the zero-temperature dynamics of the -states Potts model on undirected-directed Barabási-Albert networks and Erdös-Rényi random graphs
- Sexual reproduction from the male (men) point of view
Cited by in corpus (7)
- A Biased Review of Sociophysics
- Three-state majority-vote model on square lattice
- Cooperation in the snowdrift game on directed small-world networks under self-questioning and noisy conditions
- Analysing and controlling the tax evasion dynamics via majority-vote model
- Tax evasion dynamics and Zaklan model on Opinion-dependent Network
- Majority-vote model on Opinion-Dependent Networks
- A fast clustering algorithm for mining social network data