Critical density of activated random walks on transitive graphs

Abstract

We consider the activated random walk model on general vertex-transitive graphs. A central question in this model is whether the critical density μc for sustained activity is strictly between 0 and 1. It was known that μc>0 on Zd, d≥ 1, and that μc<1 on Z for small enough sleeping rate. We show that μc 0 as λ 0 in all vertex-transitive transient graphs, implying that μc<1 for small enough sleeping rate. We also show that μc<1 for any sleeping rate in any vertex-transitive graph in which simple random walk has positive speed. Furthermore, we prove that μc>0 in any vertex-transitive amenable graph, and that μc∈(0,1) for any sleeping rate on regular trees.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…