Mixing of the Noisy Voter Model (1403.1991v2)

Published 8 Mar 2014 in math.PR

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 thehigh-temperature regime'.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Harishchandra Ramadas

Collections

Sign up for free to add this paper to one or more collections.