English
Related papers

Related papers: On the return probability of the simple random wal…

200 papers

The key to our investigation is an improved (and in a sense sharp) understanding of the survival time of the contact process on star graphs. Using these results, we show that for the contact process on Galton-Watson trees, when the…

Probability · Mathematics 2019-07-31 Xiangying Huang , Rick Durrett

For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…

Probability · Mathematics 2018-08-30 Alan Hammond

We consider a multitype Galton-Watson process that allows for the mutation and reversion of individual types in discrete and continuous time. In this setting, we explicitly compute the time evolution of quantities such as the mean and…

Populations and Evolution · Quantitative Biology 2026-01-01 Qiao Huang , Nicolas Privault

In this article we provide new applications for exponential approximation using the framework of Pek\"oz and R\"ollin (in press), which is based on Stein's method. We give error bounds for the nearly critical Galton-Watson process…

Probability · Mathematics 2013-06-13 E. Peköz , A. Röllin

In this addendum we extend Theorem 4.6 on the negative binomial distribution in `Bounds for survival probabilities in supercritical Galton-Watson processes and applications to population genetics' (Journal of Mathematical Biology 92:40,…

Probability · Mathematics 2026-04-07 Reinhard Bürger

Let $\mathcal{T}$ denote a Galton--Watson tree with offspring distribution $\xi$ satisfying $\mathbb{E}(\xi) = 1$, and let $\mathcal{T}_n$ be the Galton--Watson tree conditioned to have exactly $n$ nodes. We show that, under a mild moment…

Probability · Mathematics 2026-03-10 Fameno Rakotoniaina , Dimbinaina Ralaivaosaona

The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…

Machine Learning · Computer Science 2022-01-25 Yuta Nakahara , Shota Saito , Akira Kamatsuka , Toshiyasu Matsushima

We consider a random walk on the support of an ergodic simple point process on R^d, d>1, furnished with independent energy marks. The jump rates of the random walk decay exponentially in the jump length and depend on the energy marks via a…

Mathematical Physics · Physics 2007-05-23 A. Faggionato , P. Mathieu

We study the maximal displacement of a one dimensional subcritical branching random walk initiated by a single particle at the origin. For each $n\in\mathbb{N},$ let $M_{n}$ be the rightmost position reached by the branching random walk up…

Probability · Mathematics 2016-03-11 Eyal Neuman , Xinghua Zheng

We study properties of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution is in the domain of attraction of a stable distribution with index $\alpha\in (1,2]$. Here the harmonic measure refers…

Probability · Mathematics 2014-05-08 Shen Lin

We consider here multitype Bienaym\'e--Galton--Watson trees, under the conditioning that the numbers of vertices of given type satisfy some linear relations. We prove that, under some smoothness conditions on the offspring distribution…

Probability · Mathematics 2023-10-20 Paul Thévenin

Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…

Statistics Theory · Mathematics 2013-07-24 Serdar Altok

We give a necessary and sufficient condition for the convergence in distribution of a conditioned Galton-Watson tree to Kesten's tree. This yields elementary proofs of Kesten's result as well as other known results on local limit of…

Probability · Mathematics 2014-07-01 Romain Abraham , Jean-Francois Delmas

We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…

Probability · Mathematics 2016-04-27 Romain Abraham , Aymen Bouaziz , Jean-François Delmas

The biased random walk on supercritical Galton--Watson trees is known to exhibit a multiscale phenomenon in the slow regime: the maximal displacement of the walk in the first $n$ steps is of order $(\log n)^3$, whereas the typical…

Probability · Mathematics 2025-06-17 Yueyun Hu , Zhan Shi

A curious connection exists between the theory of optimal stopping for independent random variables, and branching processes. In particular, for the branching process $Z_n$ with offspring distribution $Y$, there exists a random variable $X$…

Probability · Mathematics 2007-05-23 David Assaf , Larry Goldstein , Ester Samuel-Cahn

We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the…

Probability · Mathematics 2023-12-18 David A. Croydon , Daisuke Shiraishi , Satomi Watanabe

We consider quenched critical percolation on a supercritical Galton--Watson tree with either finite variance or $\alpha$-stable offspring tails for some $\alpha \in (1,2)$. We show that the GHP scaling limit of a quenched critical…

Probability · Mathematics 2026-04-10 Eleanor Archer , Tanguy Lions

We use the concept of unimodular random graph to show that the branching simple random walk on $\mathbb{Z}^{d}$ indexed by a critical geometric Galton-Watson tree conditioned to survive is recurrent if and only if $d \leq 4$.

Probability · Mathematics 2014-05-28 Itai Benjamini , Nicolas Curien

Let $\tau$n be a random tree distributed as a Galton-Watson tree with geometric offspring distribution conditioned on {Zn = an} where Zn is the size of the n-th generation and (an, n $\in$ N *) is a deterministic positive sequence. We study…

Probability · Mathematics 2017-09-28 Romain Abraham , Aymen Bouaziz , Jean-François Delmas