摘要
We investigate the naming game on geometric networks. The geometric networks are constructed by adding geometric links to two-dimensional regular lattices. It is found that the agreement time is a non-monotonic function of the geometric distance and there exists an optimal value of the geometric distance resulting in the shortest agreement time. All these results show that the geometric distance plays an important role in the evolutionary process of the language game. Our results also show that the convergence time strongly depends on the number of adding links.
We investigate the naming game on geometric networks. The geometric networks are constructed by adding geometric links to two-dimensional regular lattices. It is found that the agreement time is a non-monotonic function of the geometric distance and there exists an optimal value of the geometric distance resulting in the shortest agreement time. All these results show that the geometric distance plays an important role in the evolutionary process of the language game. Our results also show that the convergence time strongly depends on the number of adding links.
基金
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, the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No 20093402110032, and the Scientific Research Fund of Sichuan Provincial Education Department （08ZA037, 09ZA103）.
