English
Related papers

Related papers: Branching capacity of a random walk range

200 papers

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

Statistical Mechanics · Physics 2009-11-11 Tonguc Rador

We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…

Probability · Mathematics 2020-07-21 Tuan-Minh Nguyen , Stanislav Volkov

We study a system of coalescing random walks on the integer lattice $\mathbb{Z}^{d}$ in which the walk is oriented in the $d$-th direction and follows certain specified rules. We first study the geometry of the paths and show that, almost…

Probability · Mathematics 2022-08-23 Azadeh Parvaneh , Afshin Parvardeh , Rahul Roy

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

Probability · Mathematics 2017-07-06 Yueyun Hu

By extending the breadth first search algorithm to any d-type critical or subcritical irreducible branching forest, we show that such forests may be encoded through d independent, integer valued, d-dimensional random walks. An application…

Probability · Mathematics 2014-03-11 Loïc Chaumont , Rongli Liu

Let $\{Z_n\}_{n\geq 0 }$ be a critical $d$-dimensional branching random walk started from a Poisson random measure whose intensity measure is the Lebesgue measure on $\mathbb{R}^d$. Denote by…

Probability · Mathematics 2026-01-28 Shuxiong Zhang

We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…

Probability · Mathematics 2022-01-24 Thomas Duquesne , Robin Khanfir , Shen Lin , Niccolo Torri

A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…

Combinatorics · Mathematics 2009-11-07 T. H. Baker , P. J. Forrester

For a simple symmetric random walk in dimension $d\geq 3$, a uniform strong law of large numbers is proved for the number of sites with given local time up to time $n$.

Probability · Mathematics 2007-05-23 Endre Csáki , Antónia Földes , Pál Révész

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

Probability · Mathematics 2007-05-23 Robin Pemantle , Russell Lyons

In this paper, we study second order fluctuations for the size of the range of a critical branching random walk (BRW) in $\mathbb Z^d$. We consider the BRW with geometric offspring indexed by the Kesten tree, and show that the size of its…

Probability · Mathematics 2025-11-26 Tianyi Bai , Yueyun Hu

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

Probability · Mathematics 2016-12-28 Erich Baur

The aim of the current work is to prove a law of large numbers for the range size of recurrent rotor walks with random initial configuration on a general class of trees, called periodic trees or directed covers of graphs.

Probability · Mathematics 2019-10-14 Wilfried Huss , Ecaterina Sava-Huss

We study a $d$-dimensional branching random walk (BRW) in an i.i.d. random environment on $\mathbb{Z}^d$ in discrete time. A Bernoulli trap field is attached to $\mathbb{Z}^d$, where each site, independently of the others, is a trap with a…

Probability · Mathematics 2026-01-12 Mehmet Öz

We consider random walks indexed by arbitrary finite random or deterministic trees. We derive a simple sufficient criterion which ensures that the maximal displacement of the tree-indexed random walk is determined by a single large jump.…

Probability · Mathematics 2018-06-20 Pascal Maillard

In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$ and obtain its correct asymptotic in…

Probability · Mathematics 2016-06-24 Pierre Andreoletti , Xinxin Chen

In the context of countable groups of polynomial volume growth, we consider a large class of random walks that are allowed to take long jumps along multiple subgroups according to power law distributions. For such a random walk, we study…

Probability · Mathematics 2022-07-26 Zhen-Qing Chen , Takashi Kumagai , Laurent Saloff-Coste , Jian Wang , Tianyi Zheng

We give new criteria for ballistic behavior of random walks in random environment which are perturbations of the simple symmetric random walk on $\mathbb Z^d$ in dimensions $d\ge 4$. Our results extend those of Sznitman [Ann. Probab. 31,…

Probability · Mathematics 2021-03-05 Ryoki Fukushima , Alejandro F. Ramírez

We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…

Probability · Mathematics 2016-09-16 Gérard Ben Arous , Manuel Cabezas , Alexander Fribergh

We consider connectivity properties of the Branching Interlacements model in $\mathbb{Z}^d,~d\ge5$, recently introduced by Angel, R\'ath and Zhu in 2016. Using stochastic dimension techniques we show that every two vertices visited by the…

Probability · Mathematics 2016-12-02 Eviatar B. Procaccia , Yuan Zhang