Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Rapid Communication

Topology-induced coarsening in language games

Andrea Baronchelli, Luca Dall’Asta, Alain Barrat, and Vittorio Loreto
Phys. Rev. E 73, 015102(R) – Published 18 January 2006

Abstract

We investigate how very large populations are able to reach a global consensus, out of local “microscopic” interaction rules, in the framework of a recently introduced class of models of semiotic dynamics, the so-called naming game. We compare in particular the convergence mechanism for interacting agents embedded in a low-dimensional lattice with respect to the mean-field case. We highlight that in low dimensions consensus is reached through a coarsening process that requires less cognitive effort of the agents, with respect to the mean-field case, but takes longer to complete. In one dimension, the dynamics of the boundaries is mapped onto a truncated Markov process from which we analytically computed the diffusion coefficient. More generally we show that the convergence process requires a memory per agent scaling as N and lasts a time N1+2d in dimension d4 (the upper critical dimension), while in mean field both memory and time scale as N32, for a population of N agents. We present analytical and numerical evidence supporting this picture.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 23 September 2005

DOI:https://doi.org/10.1103/PhysRevE.73.015102

©2006 American Physical Society

Authors & Affiliations

Andrea Baronchelli1, Luca Dall’Asta2, Alain Barrat2, and Vittorio Loreto1

  • 1Dipartimento di Fisica, Università “La Sapienza” and SMC-INFM, Piazzale Aldo Moro 2, 00185 Rome, Italy
  • 2Laboratoire de Physique Théorique, UMR du CNRS 8627, Bâtiment 210, Université de Paris-Sud, 91405 Orsay Cedex, France

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 73, Iss. 1 — January 2006

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×

Images

  • Figure 1
    Figure 1
    (Color online) Time evolution in mean-field and finite dimensions of the total number of words (or total used memory) for the number of different words in the system, and for the average success rate. N=1024, average over 1000 realizations. The inset in the top graph shows the very slow convergence in finite dimensions.Reuse & Permissions
  • Figure 2
    Figure 2
    (Color online) Scaling of the time at which the number of words is maximal, and of the time needed to obtain convergence, in one and two dimensions.Reuse & Permissions
  • Figure 3
    Figure 3
    (Color online) Typical evolution of a one-dimensional system (N=1000). Black corresponds to interfaces (sites with more than one word). The other colors identify different single state clusters. The vertical axis represents the time (1000×N sequential steps); the one-dimensional snapshots are reported on the horizontal axis.Reuse & Permissions
  • Figure 4
    Figure 4
    (Color online) Truncated Markov process associated with interface width dynamics-schematic evolution of a C0 interface AAABBB, cut at the maximal width m=3.Reuse & Permissions
  • Figure 5
    Figure 5
    (Color online) Evolution of the position of an interface AAABBB. Top, evolution of the distribution P(x,t). Bottom, evolution of the mean-square displacement, showing a clear diffusive behavior x2=2DexptN with a coefficient Dexp0.224 in agreement with the theoretical prediction.Reuse & Permissions
×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×