Related papers: Cookie branching random walks
This paper investigates the long-time behavior of double branching annihilating random walkers with nearest-neighbor dependent rates. The system consists of even number of particles which can execute nearest-neighbor random walk and they…
Quantum walks are counterparts of classical random walks. They spread faster, which can be exploited in information processing tasks, and constitute a versatile simulation platform for many quantum systems. Yet, some of their properties can…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
We consider a two-type reducible branching Brownian motion, defined as a particle system on the real line in which particles of two types move according to independent Brownian motion and create offspring at constant rate. Particles of type…
We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. For the case where the…
In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…
The subject of this paper is the simple random walk on $\mathbb{Z}$. We give a very simple answer to the following problem: under the condition that a random walk has already spent $\alpha$-percent of the traveling time on the positive side…
We study diffusive lattice gases with local injection of particles, namely we assume that whenever the origin becomes empty, a new particle is immediately injected into the origin. We consider two lattice gases: a symmetric simple exclusion…
We consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous-time simple random walk on $\mathbb{Z}^d$, with jump rate $D_A$. These particles are called $A$-particles and move…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
We consider a branching-selection particle system on $\Z$ with $N \geq 1$ particles. During a branching step, each particle is replaced by two new particles, whose positions are shifted from that of the original particle by independently…
We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…
We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…
We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…
The Tree Builder Random Walk is a special random walk that evolves on trees whose size increases with time, randomly and depending upon the walker. After every s steps of the walker, a random number of vertices are added to the tree and…
We view random walks as the paths of foraging animals, perhaps searching for food or avoiding predators while forming a mental map of their surroundings. The formation of such maps requires them to memorise the locations they have visited.…
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…