2000 character limit reached
Cutoff for activated random walk (2501.17938v1)
Published 29 Jan 2025 in math.PR and cond-mat.stat-mech
Abstract: We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
