Metric clusters in evolutionary games on scale-free networks
arXiv:1704.00952 · doi:10.1038/s41467-017-02078-y
Abstract
The evolution of cooperation in social dilemmas in structured populations has been studied extensively in recent years. Whereas many theoretical studies have found that a heterogeneous network of contacts favors cooperation, the impact of spatial effects in scale-free networks is still not well understood. In addition to being heterogeneous, real contact networks exhibit a high mean local clustering coefficient, which implies the existence of an underlying metric space. Here, we show that evolutionary dynamics in scale-free networks self-organize into spatial patterns in the underlying metric space. The resulting metric clusters of cooperators are able to survive in social dilemmas as their spatial organization shields them from surrounding defectors, similar to spatial selection in Euclidean space. We show that under certain conditions these metric clusters are more efficient than the most connected nodes at sustaining cooperation and that heterogeneity does not always favor--but can even hinder--cooperation in social dilemmas. Our findings provide a new perspective to understand the emergence of cooperation in evolutionary games in realistic structured populations.
References in corpus (19)
- Evolutionary games on graphs
- Evolutionary prisoner's dilemma game on a square lattice
- Evolutionary dynamics of group interactions on structured populations: A review
- Hyperbolic Geometry of Complex Networks
- Control Principles of Complex Networks
- Popularity versus Similarity in Growing Networks
- Dynamical Organization of Cooperation in Complex Topologies
- Evolutionary dynamics on any population structure
- Sustaining the Internet with Hyperbolic Mapping
- Towards effective payoffs in the prisoner's dilemma game on scale-free networks
- Enhancement of cooperation in highly clustered scale-free networks
- Network Mapping by Replaying Hyperbolic Growth
- Hidden geometric correlations in real multiplex networks
- Evolutionary mixed games in structured populations: Cooperation and the benefits of heterogeneity
- Emergence of Soft Communities from Geometric Preferential Attachment
- Network Geometry Inference using Common Neighbors
- Clustering implies geometry in networks
- A stochastic behavioral model and a `microscopic' foundation of evolutionary game theory
- Collective navigation of complex networks: Participatory greedy routing
Cited by in corpus (8)
- A memory-based spatial evolutionary game with the dynamic interaction between learners and profiteers
- Emergence of geometric Turing patterns in complex networks
- Topological enslavement in evolutionary games on correlated multiplex networks
- The evolution of cooperation in spatial public goods game with tolerant punishment based on reputation threshold
- Importance of initial conditions in the polarization of complex networks
- Geometric detection of hierarchical backbones in real networks
- Random walk with hyperbolic probabilities
- The cooperation-defection evolution on social networks