Electronic Communications in Probability

Mixing of the noisy voter model

Harishchandra Ramadas

Full-text: Open access


We prove that the noisy voter model mixes extremely fast - in time of O(log(n)) on any graph with n vertices - for arbitrarily small values of the "noise parameter". We then explain why, as a result, this is an example of a spin system that is always in the "high-temperature regime".

Article information

Electron. Commun. Probab. Volume 19 (2014), paper no. 17, 17 pp.

Accepted: 8 March 2014
First available in Project Euclid: 7 June 2016

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 82C20: Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs
Secondary: 82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs

noisy voter model spin system mixing time

This work is licensed under a Creative Commons Attribution 3.0 License.


Ramadas, Harishchandra. Mixing of the noisy voter model. Electron. Commun. Probab. 19 (2014), paper no. 17, 17 pp. doi:10.1214/ECP.v19-2968. https://projecteuclid.org/euclid.ecp/1465316719

Export citation


  • Bellman, Richard. The stability of solutions of linear differential equations. Duke Math. J. 10, (1943). 643–647.
  • DobruÅ¡in, R. L. Markov processes with a large number of locally interacting components: Existence of a limit process and its ergodicity. (Russian) Problemy Peredači Informacii 7 (1971), no. 2, 70–87.
  • Dyer, Martin; Sinclair, Alistair; Vigoda, Eric; Weitz, Dror. Mixing in time and space for lattice spin systems: a combinatorial view. Randomization and approximation techniques in computer science, 149–163, Lecture Notes in Comput. Sci., 2483, Springer, Berlin, 2002.
  • Granovsky, Boris L.; Madras, Neal. The noisy voter model. Stochastic Process. Appl. 55 (1995), no. 1, 23–43.
  • Hayes, Thomas P.; Sinclair, Alistair. A general lower bound for mixing of single-site dynamics on graphs. Ann. Appl. Probab. 17 (2007), no. 3, 931–952.
  • Kelly, Frank P. Reversibility and stochastic networks. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, Ltd., Chichester, 1979. viii+230 pp. ISBN: 0-471-27601-4
  • Liggett, Thomas M. Interacting particle systems. Reprint of the 1985 original. Classics in Mathematics. Springer-Verlag, Berlin, 2005. xvi+496 pp. ISBN: 3-540-22617-6
  • Liggett, Thomas M. Continuous time Markov processes. An introduction. Graduate Studies in Mathematics, 113. American Mathematical Society, Providence, RI, 2010. xii+271 pp. ISBN: 978-0-8218-4949-1
  • Levin, David A.; Peres, Yuval; Wilmer, Elizabeth L. Markov chains and mixing times. With a chapter by James G. Propp and David B. Wilson. American Mathematical Society, Providence, RI, 2009. xviii+371 pp. ISBN: 978-0-8218-4739-8
  • Rouche, Nicolas; Habets, P.; Laloy, M. Stability theory by Liapunov's direct method. Applied Mathematical Sciences, Vol. 22. Springer-Verlag, New York-Heidelberg, 1977. xii+396 pp. ISBN 0-387-90258-9.