Related papers: Cover time for branching random walks on regular t…
We present a deterministic algorithm that given a tree T with n vertices, a starting vertex v and a slackness parameter epsilon > 0, estimates within an additive error of epsilon the cover and return time, namely, the expected time it takes…
In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
We show that the range of a critical branching random walk conditioned to survive forever and the Minkowski sum of two independent simple random walk ranges are intersection-equivalent in any dimension $d\ge 5$, in the sense that they hit…
We consider a continuous-time branching random walk on a multidimensional lattice in a random branching medium. It is theoretically known that, in such branching random walks, large rare fluctuations of the medium may lead to anomalous…
We consider a non-homogeneous random walks system on $\bbZ$ in which each active particle performs a nearest neighbor random walk and activates all inactive particles it encounters up to a total amount of $L$ jumps. We present necessary and…
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this "deterministic random walk" covers all…
We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…
We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…
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…
Consider a branching random walk on the real line with a killing barrier at zero: starting from a nonnegative point, particles reproduce and move independently, but are killed when they touch the negative half-line. The population of the…
We study critical branching random walks (BRWs) $U^{(n)}$ on~$\mathbb{Z}_{+}$ where for each $n$, the displacement of an offspring from its parent has drift~$2\beta/\sqrt{n}$ towards the origin and reflection at the origin. We prove that…
Given a supercritical branching random walk $\{Z_n\}_{n\geq 0}$ on $\mathbb{R}$, let $Z_n([y,\infty))$ be the number of particles located in $[y,\infty)\subset\mathbb{R}$ at generation $n$. Let $m$ be the mean of the offspring law of…
We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…
We study ancestral lineages of individuals of a stationary discrete-time branching annihilating random walk (BARW) on the $d$-dimensional lattice $\mathbb{Z}^d$. Each individual produces a Poissonian number of offspring with mean $\mu$…
Let $\mathbb{T}$ denote a rooted $b$-ary tree and let $\{S_v\}_{v\in \mathbb{T}}$ denote a branching random walk indexed by the vertices of the tree, where the increments are i.i.d. and possess a logarithmic moment generating function…
Consider $N$ particles performing random walks on the $\epsilon$-grid $(\epsilon Z)^d$, $\epsilon>0$ with branching and density-dependent selection: When one of the particles branches, a particle is removed from the most populated site. The…
We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. More precisely, for every D and C, there exists a=a(D,C)>0 such that for any graph G, with n vertices and…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…
Consideration is given to the continuous-time supercritical branching random walk over a multidimensional lattice with a finite number of particle generation sources of the same intensity both with and without constraint on the variance of…