Naming Game on Multi-Community Networks
Complex networks are commonly employed as the underlying communication structures in naming game studies, especially random-graph (RG), small-world (SW), and scale-free (SF) networks [1, 2, 3, 4, 5]. As can be seen from the previous chapters, different network topologies affect the naming game process significantly in different ways. Naming game simulations and analysis offer an effective computer-aided approach to building sensible mathematical models and, more importantly, better understanding of the evolution and development of human languages and social behaviors. The convergence phenomena in naming game models are typically verified via numerical simulations [6, 7, 8], theoretical proofs , and sometimes social experiments .
- 17.D.W. Guo, X.Y. Meng, M. Liu, C.F. Hou, Naming game on multi-community network. J. Comput. Res. Dev. 52(2), 487–498 (2015)Google Scholar
- 19.Lou, Y., Chen, G.R., Fan, Z.P., Xiang, L.N.: Supplementary information for paper “local communities obstruct global consensus: naming game on multi-local-world networks” (2015), http://www.ee.cityu.edu.hk/~gchen/pdf/MLW-SI.pdf