Sharp transition towards shared vocabularies in multi-agent systems

被引:238
作者
Baronchelli, Andrea
Felici, Maddalena
Loreto, Vittorio
Caglioti, Emanuele
Steels, Luc
机构
[1] Univ Roma La Sapienza, Dipartimento Fis, I-00185 Rome, Italy
[2] INFM, SMC, I-00185 Rome, Italy
[3] Univ Roma La Sapienza, Dipartimento Matemat, I-00185 Rome, Italy
[4] Vrije Univ Brussel, AI Lab, Brussels, Belgium
[5] Sony Comp Sci Lab, Paris, France
来源
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT | 2006年
关键词
interacting agent models; scaling in socio economic systems; stochastic processes; new applications of statistical mechanics;
D O I
10.1088/1742-5468/2006/06/P06014
中图分类号
O3 [力学];
学科分类号
08 ; 0801 ;
摘要
What processes can explain how very large populations are able to converge on the use of a particular word or grammatical construction without global coordination? Answering this question helps to understand why new language constructs usually propagate along an S-shaped curve with a rather sudden transition towards global agreement. It also helps to analyse and design new technologies that support or orchestrate self-organizing communication systems, such as recent social tagging systems for the web. The article introduces and studies a microscopic model of communicating autonomous agents performing language games without any central control. We show that the system undergoes a disorder/order transition, going through a sharp symmetry breaking process to reach a shared set of conventions. Before the transition, the system builds up non-trivial scale-invariant correlations, for instance in the distribution of competing synonyms, which display a Zipf-like law. These correlations make the system ready for the transition towards shared conventions, which, observed on the timescale of collective behaviours, becomes sharper and sharper with system size. This surprising result not only explains why human language can scale up to very large populations but also suggests ways to optimize artificial semiotic dynamics.
引用
收藏
页数:12
相关论文
共 29 条
[1]  
[Anonymous], 1990, Random Struct. Algorithms, DOI [DOI 10.1002/RSA.3240010305, 10.1002/rsa.3240010305]
[2]  
[Anonymous], GLOTTOMETRICS
[3]  
BERNERSLEE T, 2001, SCI AM MAY
[4]  
Best Karl-Heinz, 2003, GLOTTOMETRICS, V6, P9
[5]  
Best Karl-Heinz, 2002, GLOTTOMETRICS, V2, P11
[6]   Condensation in the Backgammon model [J].
Bialas, P ;
Burda, Z ;
Johnston, D .
NUCLEAR PHYSICS B, 1997, 493 (03) :505-516
[7]   THE EVOLUTION OF RANDOM GRAPHS [J].
BOLLOBAS, B .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1984, 286 (01) :257-274
[8]   DENSITY AND UNIQUENESS IN PERCOLATION [J].
BURTON, RM ;
KEANE, M .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1989, 121 (03) :501-505
[9]  
FERRER I, 2005, GLOTTOMETRICS, V11, P1
[10]  
Gumbel E. J., 1958, Statistics of Extremes