Exact sampling and fast mixing of Activated Random Walk

Abstract

Activated Random Walk (ARW) is an interacting particle system on the d-dimensional lattice Zd. On a finite subset V ⊂ Zd it defines a Markov chain on \0,1\V. We prove that when V is a Euclidean ball intersected with Zd, the mixing time of the ARW Markov chain is at most 1+o(1) times the volume of the ball. The proof uses an exact sampling algorithm for the stationary distribution, a coupling with internal DLA, and an upper bound on the time when internal DLA fills the entire ball. We conjecture cutoff at time ζ times the volume of the ball, where ζ<1 is the limiting density of the stationary state.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…