2000 character limit reached
Active Phase for Activated Random Walk on Z
Published 20 Sep 2020 in math.PR, math-ph, and math.MP | (2009.09491v1)
Abstract: We consider the Activated Random Walk model on $\mathbb{Z}$. In this model, each particle performs a continuous-time simple symmetric random walk, and falls asleep at rate $\lambda$. A sleeping particle does not move but it is reactivated in the presence of another particle. We show that for any sleep rate $\lambda < \infty$ if the density $ \zeta $ is close enough to $1$ then the system stays active.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.