Cutoff for activated random walk
Christopher Hoffman, Tobias Johnson, Matthew Junge, Josh Meisel

TL;DR
This paper establishes a cutoff phenomenon in the mixing time of activated random walk on an interval, occurring at a time proportional to the interval length and the critical density, using a novel graph mixing result.
Contribution
It introduces a new mixing time cutoff result for activated random walk on intervals, linking it to the critical density and activity distribution.
Findings
Mixing time exhibits cutoff at n times the critical density.
A new graph mixing result shows the chain is mixed when activity is widespread.
The proof applies to both uniform and central driving scenarios.
Abstract
We prove that the mixing time of driven-dissipative activated random walk on an interval of length with uniform or central driving exhibits cutoff at times the critical density for activated random walk on the integers. The proof uses a new result for arbitrary graphs showing that the chain is mixed once activity is likely at every site.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Stochastic processes and statistical mechanics · Formal Methods in Verification
