English

Mixing of the Noisy Voter Model

Probability 2014-04-11 v2

Abstract

We prove that the noisy voter model mixes extremely fast -- in time of O(logn)O(\log n) on any graph with nn 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'.

Keywords

Cite

@article{arxiv.1403.1991,
  title  = {Mixing of the Noisy Voter Model},
  author = {Harishchandra Ramadas},
  journal= {arXiv preprint arXiv:1403.1991},
  year   = {2014}
}

Comments

9 pages