Language Evolution and Computation Bibliography

We present a modified naming game by introducing weights of words in the evolution process. We assign the weight of a word spoken by an agent according to its connectivity, which is a natural reflection of the agent's influence in population. A tunable parameter is introduced, governing the word weight based on the connectivity of agents. We consider the scale-free topology and concentrate on the efficiency of reaching the final consensus, which is of high importance in the self-organized system. Interestingly, it is found that there exists an optimal parameter value, leading to the fastest convergence. This indicates appropriate hub's effects favor the achievement of consensus. The evolution of distinct words helps to give a qualitative explanation of this phenomena. Similar nontrivial phenomena are observed in the total memory of agents with a peak in the middle range of parameter values. Other relevant characters are provided as well, including the time evolution of total memory and success rate for different parameter values as well as the average degree of the network, which are helpful for understanding the dynamics of the modified naming game in detail.

We propose a Finite-Memory Naming Game (FMNG) model with respect to the bounded rationality of agents or finite resources for information storage in communication systems. We study its dynamics on several kinds of complex networks, including random networks, small-world networks and scale-free networks. We focus on the dynamics of the FMNG affected by the memory restriction as well as the topological properties of the networks. Interestingly, we found that the most important quantity, the convergence time of reaching the consensus, shows some non-monotonic behaviors by varying the average degrees of the networks with the existence of the fastest convergence at some specific average degrees. We also investigate other main quantities, such as the success rate in negotiation, the total number of words in the system and the correlations between agents of full memory and the total number of words, which clearly explain the nontrivial behaviors of the convergence. We provide some analytical results which help better understand the dynamics of the FMNG. We finally report a robust scaling property of the convergence time, which is regardless of the network structure and the memory restriction.