Naming games in two-dimensional and small-world-connected random geometric networks

作     者：Qiming Lu G. Korniss B. K. Szymanski 

作者机构：Department of Physics Applied Physics and Astronomy Rensselaer Polytechnic Institute 110 8th Street Troy New York 12180-3590 USA Center for Pervasive Computing and Networking Rensselaer Polytechnic Institute 110 8th Street Troy New York 12180-3590 USA Department of Computer Science Rensselaer Polytechnic Institute 110 8th Street Troy New York 12180-3590 USA 

出 版 物：《Physical Review E》 (物理学评论E辑：统计、非线性和软体物理学)

年 卷 期：2008年第77卷第1期

页      面：016111-016111页

核心收录：

学科分类：07[理学] 070203[理学-原子与分子物理] 0702[理学-物理学] 

基　　金：National Science Foundation, NSF, (0103708, 0426488) National Science Foundation, NSF 

主　　题：STATE POTTS-MODEL WIRELESS NETWORKS RENORMALIZATION-GROUP DOMAIN GROWTH 2 DIMENSIONS VOTER MODEL DYNAMICS KINETICS LANGUAGE SYSTEMS 

摘      要：We investigate a prototypical agent-based model, the naming game, on two-dimensional random geometric networks. The naming game [Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the naming games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a “small-world-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case.