Related papers: Branching capacity of a random walk range

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…

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

The a.s. existence of a polymer probability in the infinite volume limit is readily obtained under general conditions of weak disorder from standard theory on multiplicative cascades or branching random walk. However, speculations in the…

In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains…

We consider random walks in a balanced random environment in $\mathbb{Z}^d$, $d\geq 2$. We first prove an invariance principle (for $d\ge2$) and the transience of the random walks when $d\ge 3$ (recurrence when $d=2$) in an ergodic…

We consider a continuous-time branching random walk in the inhomogeneous breeding potential $\beta|.|^p$, where $\beta > 0$, $p \geq 0$. We prove that the population almost surely explodes in finite time if $p > 1$ and doesn't explode if $p…

The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…

It has been recently understood (arXiv:1212.2885, arXiv:1310.4764, arXiv:1410.0605) that for a general class of percolation models on $\mathbb{Z}^d$ satisfying suitable decoupling inequalities, which includes i.a.\ Bernoulli percolation,…

We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to…

In this paper, we study a class of random walks that build their own tree. At each step, the walker attaches a random number of leaves to its current position. The model can be seen as a subclass of the Random Walk in Changing Environments…

We consider the randomly biased random walk on trees in the slow movement regime as in [HS16], whose potential is given by a branching random walk in the boundary case. We study the heavy range up to the $n$-th return to the root, i.e., the…

The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…

This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal…

We investigate fluctuation phenomena for the graph distance and the number of cut points associated with random media arising from the range of a random walk. Our results demonstrate a sequence of dimension-dependent phase transitions in…

We calculate the spectral dimension of a wide class of tree-like fractals by solving the random walk problem through a new analytical technique, based on invariance under generalized cutting-decimation transformations. These fractals are…

We prove that every random walk in i.i.d. environment in dimension greater than or equal to 2 that has an almost sure positive speed in a certain direction, an annealed invariance principle and some mild integrability condition for…

In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…