Cutoff for the noisy voter model

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

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

Publication date 9 June 2016

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

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

zbMATH Keywords

mixing timescontinuous-time Markov chainscutoff phenomenanoisy voter models

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuous-time Markov processes on discrete state spaces (60J27)

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,1}^S$, 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.

Recommendations

• The noisy voter model
• Dynamical noise sensitivity for the voter model
• Mixing of the noisy voter model
• The Noisy Veto-Voter Model: A Recursive Distributional Equation on [0, 1]
• The noisy voter model under the influence of contrarians
• Noisy voter model for the anomalous diffusion of parliamentary presence
• Limiting behavior for a general class of voter models with confidence threshold
• On the threshold of spread-out voter model percolation
• Supportive interactions in the noisy voter model

Cites work

• scientific article; zbMATH DE number 1418385 (Why is no real title available?)
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• Broadcasting on trees and the Ising model.
• Comparison of cutoffs between lazy walks and Markovian semigroups
• Cutoff for the Ising model on the lattice
• Elements of Information Theory
• Information percolation and cutoff for the stochastic Ising model
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mixing of the noisy voter model
• Mixing times of lozenge tiling and card shuffling Markov chains
• Opinion exchange dynamics
• The noisy voter model

Cited in

(7)

• Asymptotic behaviour of the noisy voter model density process
• Fast initial conditions for Glauber dynamics
• Mixing of the noisy voter model
• Cutoff for the non reversible SSEP with reservoirs
• The mixing time for simple exclusion
• Supportive interactions in the noisy voter model
• Glauber-exclusion dynamics: rapid mixing regime

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)