Related papers: Cover time for branching random walks on regular t…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

We consider a branching random walk on a $d$-ary tree of height $n$ ($n \in \mathbb{N}$), under the presence of a hard wall which restricts each value to be positive, where $d$ is a natural number satisfying $d\geqslant2$. The question of…

We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…

We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation $k$ branch into the same random number of particles $\mathcal{L}_{k+1}\ge 2$, where the $\mathcal{L}_k$, $k\in\mathbb{N}$,…

The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…

We study a generalized branching random walk where particles breed at a rate which depends on the number of neighboring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population…

We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…

It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…

We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…

In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…

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 consider random walks on a tree $G=(V,E)$ with stationary distribution $\pi_v = \mathrm{deg}(v)/2|E|$ for $v \in V$. Let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at vertex $v$ to…

For a simple (unbiased) random walk on a connected graph with $n$ vertices, the cover time (the expected number of steps it takes to visit all vertices) is at most $O(n^3)$. We consider locally biased random walks, in which the probability…

In this paper, we consider the subcritical branching random walk in a random environment. We assume the branching and the step jump are independent; and the branching is in random envirenment, i.e., the particles in generation $n$ produce…

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…

We consider a population of particles with unit life length. Dying each particle produces offspring whose size depends on the random environment specifying the reproduction law of all particles of the given generation and on the number of…

We study a discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice. Each particle produces a Poissonian number of offspring with mean $\mu$ which independently move to a uniformly chosen site within a fixed…

We consider a particle moving in continuous time as a Markov jump process; its discrete chain is given by an ordinary random walk on ${\mathbb Z}^d$ , and its jump rate at $({\mathbf x},t)$ is given by a fixed function $\varphi$ of the…

We study the survival probability and the growth rate for branching random walks in random environment (BRWRE). The particles perform simple symmetric random walks on the $d$-dimensional integer lattice, while at each time unit, they split…

We consider a branching-selection particle system on the real line, introduced by Brunet and Derrida. In this model the size of the population is fixed to a constant $N$. At each step individuals in the population reproduce independently,…