Naming Game on small-world networks: the role of clustering structure
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.