English

Critical density of activated random walks on transitive graphs

Probability 2017-12-14 v3 Mathematical Physics math.MP

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\mu_c for sustained activity is strictly between 0 and 1. It was known that μc>0\mu_c>0 on Zd\mathbb{Z}^d, d1d\geq 1, and that μc<1\mu_c<1 on Z\mathbb{Z} for small enough sleeping rate. We show that μc0\mu_c\to 0 as λ0\lambda\to 0 in all vertex-transitive transient graphs, implying that μc<1\mu_c<1 for small enough sleeping rate. We also show that μc<1\mu_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\mu_c>0 in any vertex-transitive amenable graph, and that μc(0,1)\mu_c\in(0,1) for any sleeping rate on regular trees.

Keywords

Cite

@article{arxiv.1512.02397,
  title  = {Critical density of activated random walks on transitive graphs},
  author = {Alexandre Stauffer and Lorenzo Taggi},
  journal= {arXiv preprint arXiv:1512.02397},
  year   = {2017}
}

Comments

22 pages, 1 Figure. Title changed, improved exposition