科研之友
微信
新浪微博
Facebook
分享链接
摘要
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(R(s)*alpha), where R(s) is the success ratio of the name and alpha is a tunable parameter. By investigating the effects of alpha on the evolutionary processes for both square lattice and scale-free networks, we find that the convergence time decreases with the increasing alpha on both two networks, which indicates that preferential selection of successful words can accelerate the reaching of consensus. More interestingly, for alpha > 0, we find that the relation between convergence time and alpha exhibits a power-law form.
