Related papers: Local Density of Activated Random Walk on $\mathbb…
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…
Distribution of loops in a one-dimensional random walk (RW), or, equivalently, neutral segments in a sequence of positive and negative charges is important for understanding the low energy states of randomly charged polymers. We investigate…
In this paper we present rigorous results on the critical behavior of the Activated Random Walk model. We conjecture that on a general class of graphs, including $\mathbb{Z}^d$, and under general initial conditions, the system at the…
We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…
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 study the Activated Random Walk model on the one-dimensional ring, in the high density regime. We develop a toppling procedure that gradually builds an environment that can be used to show that activity will be sustained for a long time.…
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 present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
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…
We offer theoretical explanations for some recent observations in numerical simulations of quantum random walks (QRW). Specifically, in the case of a QRW on the line with one particle (walker) and two entangled coins, we explain the…
Random walk in random environment (RWRE) is a fundamental model of statistical mechanics, describing the movement of a particle in a highly disordered and inhomogeneous medium as a random walk with random jump probabilities. It has been…
Unlike many particle systems, Activated Random Walk has nontrivial behavior even in one spatial dimension. We prove inner and outer bounds on the spread of n activated random walkers from a single source in Z. The inner bound involves a…
Activated Random Walk is a particle system displaying Self-Organized Criticality, in that the dynamics spontaneously drive the system to a critical state. How universal is this critical state? We state many interlocking conjectures aimed at…
We study the localization of probability distribution in a discrete quantum random walk on an infinite chain. With a phase defect introduced in any position of the quantum random walk (QRW), we have found that the localization of the…
We review various features of the statistics of random paths on graphs. The relationship between path statistics and Quantum Mechanics (QM) leads to two canonical ways of defining random walk on a graph, which have different statistics and…
The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are…
We prove that the model of Activated Random Walks on Z^d with biased jump distribution does not fixate for any positive density, if the sleep rate is small enough, as well as for any finite sleep rate, if the density is close enough to 1.…
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…
We study a random walk driven by a particle system from a generic class, and establish a law of large numbers for the walk for almost all densities of the environment. To do so, we exploit the finite-ranged approximations of the environment…
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…