摘要
说出的比赛是为一种语言或一个通讯系统的自我组织的出现的 nonequilibrium 动力学的一个模型。我们学习扬声器与与 exp 成正比的可能性从它的库存在选择一个词的最小的说出游戏的一个修改版本(R * 一) ,在 R 是名字的成功比率的地方并且一是一个悦耳的参数。由调查效果一上为方形的格子和没有规模的网络的进化过程,我们发现集中时间与增加减少一上二联网,它显示成功的词的优先的选择能加速到达一致。更有趣地,为一 > 0,我们发现在集中之间的关系预定并且一展览一种幂定律形式。[从作者抽象]
The naming game is a model of nonequilibrium dynamics for the self-organized emergence of a language or a communication system. We study a modified version of the minimal naming game in which the speaker selects a word from its inventory with a probability proportional to exp(Rs * α), where Rs is the success ratio of the name and α is a tunable parameter. By investigating the effects of α on the evolutionary processes for both square lattice and scale-free networks, we find that the convergence time decreases with the increasing α on both two networks, which indicates that preferential selection of successful words can accelerate the reaching of consensus. More interestingly, for α 〉 0, we find that the relation between convergence time and α exhibits a power-law form.
基金
Supported by the National Basic Research Program of China under Grant No 2006CB705500, the National Natural Science Foundation of China under Grant Nos 10975126 and 10635040, and the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No 20093402110032.