Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 117 tok/s Pro
Kimi K2 176 tok/s Pro
GPT OSS 120B 457 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

Critical density of activated random walks on transitive graphs (1512.02397v3)

Published 8 Dec 2015 in math.PR, math-ph, and 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 $\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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.