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
Multivariate amplitude analysis of the cascade particle decays based on the Nearest Neighbors fitting
I. V. Yeletskikh, A. O. Vasyukov
The geometry of uncertainty decomposition in profile-likelihood fits
Rafael Coelho Lopes de Sá
Statistical validation of calorimeter inpainting with generative diffusion priors
Himanshu Raj, Roli Esha
Unknown Unknowns: Model Misspecification in Machine Learning for Physics
Juan Cruz-Martinez, Carolina Cuesta-Lazaro, Alexander Held et al.
Exploring new directions in enhancing the ACTS parameter optimization suite
Chance LaVoie, Qi Bin Lei, Rocky Bala Garg et al.
Analytically Consistent Reconstruction of Finite Data Using Padé Sequences
Emerson Díaz, Balma Duch, Pere Masjuan