Adam Mickiewicz University, Poznan, Poland.
Artif Life. 2012 Summer;18(3):311-23. doi: 10.1162/artl_a_00067. Epub 2012 Jun 4.
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 essentially 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 important 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 present. A comparison of distribution of languages in our model and in the human population is discussed.
我们研究了自适应加权网络上的命名游戏。给定一对主体之间的连接权重取决于它们的通信成功率，并决定主体进行通信的概率。在某些情况下，取决于模型的参数，对成功通信主体的偏好实际上可以忽略不计，并且模型的行为类似于完全图上的命名游戏。特别是，它会很快达到单语言状态，尽管动态的某些细节与完全图版本不同。在其他一些情况下，对成功通信主体的偏好变得更加重要，并且模型陷入多语言状态。在这种情况下，语言的逐渐粗化和灭绝导致主导语言的出现，尽管仍存在其他一些语言。讨论了我们的模型和人类群体中语言分布的比较。
