pith. sign in

arxiv: 1512.02397 · v3 · pith:XXIMCWSPnew · submitted 2015-12-08 · 🧮 math.PR · math-ph· math.MP

Critical density of activated random walks on transitive graphs

classification 🧮 math.PR math-phmath.MP
keywords ratesleepingvertex-transitivegraphsrandomactivatedcriticaldensity
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.