Highly clustered complex networks in the configuration model: Random regular small-world network

Jeong, Won Joon; Jang, Hoseung; Yu, Unjong

doi:10.1209/0295-5075/128/16001

Cited by 12 publications

(6 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the evolutionary game dynamics is taking place in one network layer (as in our present paper), while in the other layer there is a spread of opinions [56] about different immigration topics (including the debates on the duration of naturalization procedures); the opinion layer can then influence the game dynamics in the physical interaction layer, and conversely, the game outcomes can alter the evolution of opinions in the information layer, affecting thereby the population consensus about immigration and naturalization issues. In addition, other lattices [57] and other network types [58] should be explored as the underlying interaction structures of these multilayered systems.…”

Section: General Discussion and Future Research Directionsmentioning

confidence: 99%

Evolution of cooperation in multi-agent systems with time-varying tags, multiple strategies, and heterogeneous invasion dynamics

Jeong¹,

Hadzibeganovic²,

Yu³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

The degree of cooperation that can be attained in an open dynamic system fundamentally depends upon information distributed across its components. Yet in an environment with rapidly enlarging complexity, this information may need to change adaptively to enable not only cooperative interactions but also the mere survival of an organism. Combining the methods of evolutionary game theory, agent-based simulation, and statistical physics, we develop a model of the evolution of cooperation in an ageing population of artificial decision makers playing spatial tag-mediated prisoner's dilemma games with their ingroup neighbors and with genetically unrelated immigrant agents. We study the behavior of this model in the presence of four conditional and two unconditional strategies, and we introduce the concept of time-varying tags such that the phenotypic features of 'new' agents that invade the system from the outside can change into 'approved' following variable approval times. In a series of systematic Monte Carlo simulations, we observed that ingroup-biased ethnocentric cooperation can dominate only at low costs and short approval times. In the standard 4-strategy model with fixed tags, we identified a critical cost c crit above which cooperation transitioned abruptly into the phase of pure defection, revealing remarkable fragility of ingroup-biased generosity. In our generalized 6-strategy model with time-varying tags, the maintenance of cooperation was observed for a much wider region of the parameter space, reaching its peak at intermediate approval times and cost values above c crit . Our findings suggest that in an open system subject to immigration dynamics, high levels of social cooperation can be attained if a fraction of the population adopts the strategy with an egalitarian generosity directed towards both native and approved naturalized citizens, regardless of their actual origin. These findings also suggest that instead of relying upon arbitrarily fixed approval times, there is an optimal duration of the naturalization procedure from which the society as a whole can profit most.

show abstract

Section: General Discussion and Future Research Directionsmentioning

confidence: 99%

Evolution of cooperation in multi-agent systems with time-varying tags, multiple strategies, and heterogeneous invasion dynamics

Jeong¹,

Hadzibeganovic²,

Yu³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…We consider various graphs and networks: square lattice, random regular graph (RRG), 34,35 Barabási-Albert (BA) scale-free network, 31 Holme-Kim (HK) scale-free network, 33 and real-world networks. 41 These graphs and networks consist of nodes and edges.…”

Section: Model and Methodsmentioning

confidence: 99%

“…The RRG was generated by the algorithm introduced in Ref. 35. The results are averaged over 100 000 generations after the system reaches equilibrium and the results of 30 independent simulations are averaged for the final results.…”

Section: B Critical Behaviors Of the Coordination Game With The Zero ...mentioning

confidence: 99%

“…Many kinds of social networks in the real world have been uncovered; but for a systematic study with controlled parameters, many model networks have been proposed. [30][31][32][33][34][35] A model network can be generated for a given degree distribution, clustering coefficient, average shortest path length, and assortativity in most cases. However, it is not clear yet whether the model network behaves in the same way as the real-world network in each of the specific problems.…”

Section: Introductionmentioning

confidence: 99%

“…25 For this reason, although the level of cooperation is influenced by many factors (noise level, dynamic rules, payoff parameters, etc), the detailed network structure is also crucial. 35,[38][39][40] In this paper, we study the aspiration-based coordination game in various networks including real-world networks. We show that the game is mapped to the Ising model in a specific condition.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Critical Phenomena and Strategy Ordering with Hub Centrality Approach in the Aspiration-based Coordination Game

Jeong,

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We study the coordination game with an aspiration-driven update rule in regular graphs and scale-free networks. We prove that the model coincides exactly with the Ising model and shows a phase transition at the critical selection noise when the aspiration level is zero. It is found that the critical selection noise decreases with clustering in random regular graphs. With a non-zero aspiration level, the model also exhibits a phase transition as long as the aspiration level is smaller than the degree of graphs. We also show that the critical exponents are independent of clustering and aspiration level to confirm that the coordination game belongs to the Ising universality class. As for scale-free networks, the effect of aspiration level on the order parameter at a low selection noise is examined. In model networks (Barabási-Albert network and Holme-Kim network), the order parameter abruptly decreases when the aspiration level is the same as the average degree of the network. In real-world networks, in contrast, the order parameter decreases gradually. We explain this difference by proposing the concepts of hub centrality and local hub. The histogram of hub centrality of real-world networks separates into two parts unlike model networks, and local hubs exist only in real-world networks. We conclude that the difference of network structures in model and real-world networks induces qualitatively different behavior in the coordination game.The coordination game describes the emergence of standards, opinion formation, and the diffusion of innovations, which are important problems in sociology, business administration, and statistical mechanics. In this paper, we study the coordination game with an aspiration-based update rule, where each agent prefers to change its strategy if the payoff is small relative to the aspiration. For regular graphs, we demonstrate that the game shows phase transition into a frozen state dominated by one strategy as the selection noise decreases. Interestingly, the critical exponents, which determine the critical behavior at the transition, are the same as the Ising model in spite of the nonequilibrium nature of the coordination game. As for scalefree networks, we discovered a striking difference between model networks and real-world networks in the dynamics of the coordination game. We show the difference is from local hubs, which exist only in real-world networks. Local hubs play dominant roles within their neighborhoods, though their degrees are not so large. The local hubs are identified by the hub centrality, which we propose in this paper. We further discuss the dynamics of local hubs and relation with their neighbors.

show abstract

Cooperation dynamics based on reputation in the mixed population with two species of strategists

Gao

Wang

Zhang

et al. 2021

Applied Mathematics and Computation

View full text Add to dashboard Cite

Highly clustered complex networks in the configuration model: Random regular small-world network

Cited by 12 publications

References 66 publications

Evolution of cooperation in multi-agent systems with time-varying tags, multiple strategies, and heterogeneous invasion dynamics

Evolution of cooperation in multi-agent systems with time-varying tags, multiple strategies, and heterogeneous invasion dynamics

Critical Phenomena and Strategy Ordering with Hub Centrality Approach in the Aspiration-based Coordination Game

Cooperation dynamics based on reputation in the mixed population with two species of strategists

Contact Info

Product

Resources

About