Disassortative mixing accelerates consensus in the naming game

Abstract

In this paper, we study the role of degree mixing in the naming game. It is found that consensus can be accelerated on disassortative networks. We provide a qualitative explanation of this phenomenon based on clusters statistics. Compared with assortative mixing, disassortative mixing can promote the merging of different clusters, thus resulting in a shorter convergence time. Other quantities, including the evolutions of the success rate, the number of total words and the number of different words, are also studied.

References in corpus (20)

• Emergence of scaling in random networks
• Assortative mixing in networks
• Statistical physics of social dynamics
• Voter Model on Heterogeneous Graphs
• Epidemic spreading in correlated complex networks
• Dynamics of Majority Rule
• Sharp transition towards shared vocabularies in multi-agent systems
• Construction and properties of assortative random networks
• Non-equilibrium dynamics of language games on complex networks
• Who's talking first? Consensus or lack thereof in coevolving opinion formation models
• Topology Induced Coarsening in Language Games
• Agreement dynamics on small-world networks
• In-depth analysis of the Naming Game dynamics: the homogeneous mixing case
• Role of feedback and broadcasting in the naming game
• Naming Games in Two-Dimensional and Small-World-Connected Random Geometric Networks
• Consensus in networks of mobile communicating agents
• Consequence of reputation in an open-ended Naming Game
• Phase transition and hysteresis in scale-free network traffic
• Language structure in the n-object naming game
• Phase transition and fast agreement in Naming Game with preference for multi-word agents