Mixing of the Noisy Voter Model

Harishchandra Ramadas

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…