Related papers: Activated Random Walk on a cycle
Background: This study is mainly motivated by the need of understanding how the diffusion behaviour of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell,…
Self-propelled particles serve as minimal models for emulating the dynamic self-organization of microorganisms, yet most synthetic systems remain limited to a single mode of motion, namely active Brownian particles (ABPs). Here, we present…
The physics of glass has been a significant topic of interest for decades. Dynamical facilitation is widely believed to be an important characteristic of glassy dynamics, but the precise mechanism is still under debate. We propose a lattice…
We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…
We consider the Activated Random Walk model in any dimension with any sleep rate and jump distribution and ergodic initial state. We show that the stabilization properties depend only on the average density of particles, regardless of how…
To explain the ubiquity of power laws and fractals in nature, Bak, Tang, and Wiesenfeld formulated simple conditions for a system to self-organize into a critical state. Dickman, Mu\~noz, Vespignani, and Zapperi postulated that the…
This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…
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.
Vertex-Reinforced Random Walk (VRRW), defined by Pemantle (1988a), is a random process in a continuously changing environment which is more likely to visit states it has visited before. We consider VRRW on arbitrary graphs and show that on…
The Maximal Entropy Random Walk (MERW) is a natural process on a finite graph, introduced a few years ago with motivations from theoretical physics. The construction of this process relies on Perron-Frobenius theory for adjacency matrices.…
Applied to statistical physics models, the random cost algorithm enforces a Random Walk (RW) in energy (or possibly other thermodynamic quantities). The dynamics of this procedure is distinct from fixed weight updates. The probability for a…
We consider a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory called the elephant random walk (ERW). We prove a strong invariance principle for the ERW. More specifically, we prove that, under a suitable…
Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…
We consider continuous time random walks (CTRW) for open systems that exchange energy and matter with multiple reservoirs. Each waiting time distribution (WTD) for times between steps is characterized by a positive parameter a, which is set…
We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…
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…
We consider the limit behavior of an excited random walk (ERW), i.e., a random walk whose transition probabilities depend on the number of times the walk has visited to the current state. We prove that an ERW being naturally scaled…
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…
We prove results for random walks in dynamic random environments which do not require the strong uniform mixing assumptions present in the literature. We focus on the "environment seen from the walker"-process and in particular its…
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…