Naming Game on small-world networks: the role of clustering structure
Bo-Yu Lin, Jie Ren, Hui-Jie Yang, Bing-Hong Wang
Abstract
Naming Game is a recently proposed model for describing how a multi-agent system can converge towards a consensus state in a self-organized way. In this paper, we investigate this model on the so-called homogeneous small-world networks and focus on the influence of the triangular topology on the dynamics. Of all the topological quantities, the clustering coefficient is found to play a significant role in the dynamics of the Naming Game. On the one hand, it affects the maximum memory of each agent; on the other hand, it inhibits the growing of clusters in which agents share a common word, i.e., a larger clustering coefficient will cause a slower convergence of the system. We also find a quantitative relationship between clustering coefficient and the maximum memory.
Create a lesson
Related papers
Data geometry preserves prediction but reshapes explanation
Nicola Amoroso, Mario Caruso, Marianna La Rocca et al.
Developing Multi-Dimensional, Sequential sWeighting Routines for Reaction Selection with Emphasis on Kaon Identification at CLAS12
A. Acar, M. Bashkanov, D. P. Watts et al.
Attributing extreme-event probability to a source variable
Daniel F. T. Hagan
Simulation-Based Inference and Unbinned Asimov Construction with Hybrid Neural Density Estimation
Rafael Coelho Lopes de Sa, Jay Sandesara
β-Oslo and Shape analyses with unresolved parent-state mixtures
Yangping Shen
Constrained surrogates for arbitrary families of continuous probability distributions
Jack Murdoch Moore, Eduardo G Altmann