Electronic Journal of Probability

The naming game on the complete graph

Eric Foxall

Full-text: Open access


We consider a model of language development, known as the naming game, in which agents invent, share and then select descriptive words for a single object, in such a way as to promote local consensus. When formulated on a finite and connected graph, a global consensus eventually emerges in which all agents use a common unique word. Previous numerical studies of the model on the complete graph with $n$ agents suggest that when no words initially exist, the time to consensus is of order $n^{1/2}$, assuming each agent speaks at a constant rate. We show rigorously that the time to consensus is at least $n^{1/2-o(1)}$, and that it is at most constant times $\log n$ when only two words remain. In order to do so we develop some useful estimates for semimartingales with bounded jumps.

Article information

Electron. J. Probab., Volume 23 (2018), paper no. 126, 42 pp.

Received: 1 March 2017
Accepted: 23 November 2018
First available in Project Euclid: 19 December 2018

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]

interacting particle system naming game

Creative Commons Attribution 4.0 International License.


Foxall, Eric. The naming game on the complete graph. Electron. J. Probab. 23 (2018), paper no. 126, 42 pp. doi:10.1214/18-EJP250. https://projecteuclid.org/euclid.ejp/1545188693

Export citation


  • [1] Andrea Baronchelli, Luca Dall’Asta, Alain Barrat, and Vittorio Loreto. Topology-induced coarsening in language games. Physical Review E, 73(1):015102, 2006.
  • [2] Andrea Baronchelli, Maddalena Felici, Vittorio Loreto, Emanuele Caglioti, and Luc Steels. Sharp transition towards shared vocabularies in multi-agent systems. Journal of Statistical Mechanics: Theory and Experiment, 2006(06):P06014, 2006.
  • [3] Andrea Baronchelli, Vittorio Loreto, and Luc Steels. In-depth analysis of the naming game dynamics: the homogeneous mixing case. International Journal of Modern Physics C, 19(05):785–812, 2008.
  • [4] A. Basak, R. Durrett, and E. Foxall. Diffusion limit for the partner model at the critical value. Preprint on the ArXiv, 2018.
  • [5] Claudio Castellano, Santo Fortunato, and Vittorio Loreto. Statistical physics of social dynamics. Reviews of modern physics, 81(2):591, 2009.
  • [6] Luca Dall’Asta, Andrea Baronchelli, Alain Barrat, and Vittorio Loreto. Nonequilibrium dynamics of language games on complex networks. Physical Review E, 74(3):036105, 2006.
  • [7] K. Dzhaparidze and J.H. van Zenten. On bernstein-type inequalities for martingales. Stochastic Processes and their Applications, 93:109–117, 2001.
  • [8] Jean Jacod and Albert Shiryaev. Limit Theorems for Stochastic Processes. Springer, second edition, 2003.
  • [9] O. Kallenberg. Foundations of Modern Probability Theory. Springer, 2006.
  • [10] P. Protter. Stochastic Integration and Differential Equations. Springer-Verlag, second edition, 2005.