Naming Game on Adaptive Weighted Networks
arXiv:1107.3263 · doi:10.1162/artl_a_00067
Abstract
We examine a naming game on an adaptive weighted network. A weight of connection for a given pair of agents depends on their communication success rate and determines the probability with which the agents communicate. In some cases, depending on the parameters of the model, the preference toward successfully communicating agents is basically negligible and the model behaves similarly to the naming game on a complete graph. In particular, it quickly reaches a single-language state, albeit some details of the dynamics are different from the complete-graph version. In some other cases, the preference toward successfully communicating agents becomes much more relevant and the model gets trapped in a multi-language regime. In this case gradual coarsening and extinction of languages lead to the emergence of a dominant language, albeit with some other languages still being present. A comparison of distribution of languages in our model and in the human population is discussed.
22 pages, accepted in Artificial Life
References in corpus (14)
- Statistical mechanics of complex networks
- Statistical physics of social dynamics
- Glassy dynamics of kinetically constrained models
- Nonequilibrium phase transition in the coevolution of networks and opinions
- Sharp transition towards shared vocabularies in multi-agent systems
- Consensus formation on adaptive 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
- Coevolution of agents and networks: Opinion spreading and community disconnection
- Agreement dynamics on small-world networks
- Anomalous lifetime distributions and topological traps in ordering dynamics
- Language structure in the n-object naming game
- Bio-linguistic transition and Baldwin effect in an evolutionary naming-game model