arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.3263cond-mat.stat-mechcs.CLphysics.soc-ph
收藏

自适应加权网络上的博弈

Naming Game on Adaptive Weighted Networks

Adam Mickiewicz University(亚当·密茨凯维奇大学)

Dorota Lipowska, Adam Lipowski

摘要:

我们研究了一个自适应加权网络上的命名游戏。一对给定的代理的连接的权重取决于它们的通信成功率,并确定代理通信的概率。在某些情况下,根据模型的参数,对成功沟通的代理的偏好基本上可以忽略不计,模型的行为类似于完全图上的命名游戏。特别是,它很快就达到了单语言状态,尽管动态的一些细节与完整图版本不同。在其他一些情况下,对成功沟通代理的偏好变得更加相关,模型陷入了多语言制度。在这种情况下,语言的逐渐粗化和消亡导致了一种占主导地位的语言的出现,尽管其他一些语言仍然存在。在我们的模型和人口中的语言分布的比较进行了讨论。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑