Language Evolution and Computation Bibliography

Our site (www.isrl.uiuc.edu/amag/langev) retired, please use https://langev.com instead.
Han-Xin Yang
2009
Physica A: Statistical Mechanics and its Applications 388(17):3615-3620, 2009
The naming game model characterizes the main evolutionary features Of languages or more generally of communication systems. Very recently, the combination of complex networks and the naming game has received Much attention and the influences of various topological properties on ...MORE ⇓
The naming game model characterizes the main evolutionary features Of languages or more generally of communication systems. Very recently, the combination of complex networks and the naming game has received Much attention and the influences of various topological properties on the corresponding dynamical behavior have been widely studied. In this paper, we investigate the naming game on small-world geographical networks. The small-world geographical networks are constructed by randomly adding links to two-dimensional regular lattices, and it is found that the convergence time is a nonmonotonic function of the geographical distance of randomly added shortcuts. This phenomenon indicates that. although a long geographical distance of the added shortcuts favors consensus achievement, too long a geographical distance of the added shortcuts inhibits the convergence process, making it even slower than the moderates.
2008
Physical Review E 77:027103, 2008
We propose an asymmetric negotiation strategy to investigate the influence of high-degree agents on the agreement dynamics in a structured language game, the naming game. We introduce a model parameter, which governs the frequency of high-degree agents acting as speakers in ...MORE ⇓
We propose an asymmetric negotiation strategy to investigate the influence of high-degree agents on the agreement dynamics in a structured language game, the naming game. We introduce a model parameter, which governs the frequency of high-degree agents acting as speakers in communication. It is found that there exists an optimal value of the parameter that induces the fastest convergence to a global consensus on naming an object for both scale-free and small-world naming games. This phenomenon indicates that, although a strong influence of high-degree agents favors consensus achievement, very strong influences inhibit the convergence process, making it even slower than in the absence of influence of high-degree agents. Investigation of the total memory used by agents implies that there is some trade-off between the convergence speed and the required total memory. Other quantities, including the evolution of the number of different names and the relationship between agents' memories and their degrees, are also studied. The results are helpful for better understanding of the dynamics of the naming game with asymmetric negotiation strategy.