Accelerating Consensus by Preferential Words in the Naming Game  

作　　者：庄勇 刘润然 杨涵新 史冬梅 汪秉宏 

机构地区：[1]Department of Modern Physics, University of the Science and Technology of China, Hefei 230026 [2]Department of Physics, Bohai University, Jinzhou 121000 [3]The Research Center for Complex System Science, University of Shanghai for Science and Technology and Shanghai Academy of System Science, Shanghai 200093

出　　处：《Chinese Physics Letters》2010年第10期228-231,共4页中国物理快报（英文版）

基　　金：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.

摘　　要：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.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.

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TS952.83[自动化与计算机技术—计算机科学与技术]