Cutoff for the noisy voter model

From MaRDI portal
Publication:292913

DOI10.1214/15-AAP1108zbMATH Open1339.60109arXiv1408.5122OpenAlexW314744480MaRDI QIDQ292913FDOQ292913

Jeffrey E. Steif, J. Theodore Cox, Yuval Peres

Publication date: 9 June 2016

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: Given a continuous time Markov Chain q(x,y) on a finite set S, the associated noisy voter model is the continuous time Markov chain on 0,1S, which evolves in the following way: (1) for each two sites x and y in S, the state at site x changes to the value of the state at site y at rate q(x,y); (2) each site rerandomizes its state at rate 1. We show that if there is a uniform bound on the rates q(x,y) and the corresponding stationary distributions are almost uniform, then the mixing time has a sharp cutoff at time log|S|/2 with a window of order 1. Lubetzky and Sly proved cutoff with a window of order 1 for the stochastic Ising model on toroids; we obtain the special case of their result for the cycle as a consequence of our result. Finally, we consider the model on a star and demonstrate the surprising phenomenon that the time it takes for the chain started at all ones to become close in total variation to the chain started at all zeros is of smaller order than the mixing time.


Full work available at URL: https://arxiv.org/abs/1408.5122





Cites Work


Cited In (7)


Recommendations





This page was built for publication: Cutoff for the noisy voter model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q292913)