Paper detail

Separation cutoff for Activated Random Walks

We consider Activated Random Walks on arbitrary finite networks, with particles being inserted at random and absorbed at the boundary. Despite the non-reversibility of the dynamics and the lack of knowledge on the stationary distribution, we explicitly determine the relaxation time of the process, and prove that separation cutoff is equivalent to the product condition. We also provide sharp estimates on the center and width of the cutoff window. Finally, we illustrate those results by establishing explicit separation cutoffs on various networks, including: (i) large finite subgraphs of any fixed infinite non-amenable graph, with absorption at the boundary and (ii) large finite vertex-transitive graphs with absorption at a single vertex. The latter result settles a conjecture of Levine and Liang. Our proofs rely on the refined analysis of a strong stationary time recently discovered by Levine and Liang and involving the IDLA process.