Mixing of the Noisy Voter Model
classification
🧮 math.PR
keywords
modelnoisyvoteralwaysarbitrarilyexampleexplainextremely
read the original abstract
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 explain why, as a result, this is an example of a spin system that is always in the `high-temperature regime'.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.