Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Interacting particle systems in time-dependent statistical mechanics (82C22) Voting theory (91B12)
Abstract: We prove that the noisy voter model mixes extremely fast -- in time of on any graph with 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'.
Recommendations
- The noisy voter model
- Dynamical noise sensitivity for the voter model
- The noisy voter model under the influence of contrarians
- Cutoff for the noisy voter model
- A mixture of the exclusion process and the voter model
- The Noisy Veto-Voter Model: A Recursive Distributional Equation on [0, 1]
- Supportive interactions in the noisy voter model
- Noisy voter model for the anomalous diffusion of parliamentary presence
Cited in
(8)- The noisy voter model
- Dynamical noise sensitivity for the voter model
- Supportive interactions in the noisy voter model
- Cutoff for the noisy voter model
- Reduction from non-Markovian to Markovian dynamics: the case of aging in the noisy-voter model
- A mixture of the exclusion process and the voter model
- Global information from local observations of the noisy voter model on a graph
- Asymptotic behaviour of the noisy voter model density process
This page was built for publication: Mixing of the noisy voter model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743094)
