相关论文: An Upper Bound on the critical density for Activat…

Activated Random Walks, on $\mathbb{Z}^d$ for any $d\geqslant 1$, is an interacting particle system, where particles can be in either of two states: active or frozen. Each active particle performs a continuous-time simple random walk during…

We show that the critical density for activated random walk on $\mathbb{Z}^d$ approaches the sleep probability as $d \to \infty$ and provide the first-order correction.

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

We consider symmetric activated random walks on $\mathbb{Z}$, and show that the critical density $\zeta_c$ satisfies $c\sqrt{\lambda} \leq \zeta_c(\lambda) \leq C \sqrt{\lambda}$ where $\lambda$ denotes the sleep rate.

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…

We study the asymptotic behavior of the critical density of the activated random walk model as the sleep rate $\lambda$ tends to $0$ and $\infty$. For large $\lambda$, we prove new lower bounds in dimensions 1 and 2, showing that in one…

We show that for small enough sleep rate, the critical density of the symmetric Activated Random Walk model on $\mathbb Z^2$ is strictly less than one.

The density conjecture for activated random walk on the interval was recently resolved using a new tool called layer percolation. As a step towards understanding how layer percolation extends to activated random walk on more complex graphs,…

We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…

We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…

We show that Activated Random Walk on $\mathbb{Z}$ is explosive above criticality. That is, activating a single particle in a supercritical state of sleeping particles triggers an infinite avalanche of activity with positive probability.…

We show that the critical density of the Activated Random Walk model on $\mathbb{Z}^d$ is strictly less than one when the sleep rate $\lambda$ is small enough, and tends to $0$ when $\lambda\to 0$, in any dimension $d\geqslant 1$. As far as…

Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…

It has been conjectured that the critical density of the Activated Random Walk model is strictly less than one for any value of the sleeping rate. We prove this conjecture on $\mathbb{Z}^d$ when $d \geq 3$ and, more generally, on graphs…

We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…

We study the critical behavior of surface-interacting self-avoiding random walks on a class of truncated simplex lattices, which can be labeled by an integer $n\ge 3$. Using the exact renormalization group method we have been able to obtain…

In this paper, we derive explicit formulas for the surface averaged first exit time of a discrete random walk on a finite lattice. We consider a wide class of random walks and lattices, including random walks in a non-trivial potential…

We consider the activated random walk (ARW) model where particles follow the path of a general Markov process on a general graph. We prove ARW dominates a simpler process, multiple source internal aggregation (MSIA), and use this to…

We consider Activated Random Walks on $\Z$ with totally asymmetric jumps and critical particle density, with different time scales for the progressive release of particles and the dissipation dynamics. We show that the cumulative flow of…