English
Related papers

Related papers: Long edges in Galton-Watson trees

200 papers

Pruning processes $(\mathcal{F}(\theta),\theta\geq 0)$ have been studied separately for Galton-Watson trees and for L\'evy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem…

Probability · Mathematics 2014-09-04 Hui He , Matthias Winkel

This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments…

Probability · Mathematics 2017-09-29 Daniela Bertacchi , Pablo M. Rodriguez , Fabio Zucca

We prove an invariance principle for linearly edge reinforced random walks on $\gamma$-stable critical Galton-Watson trees, where $\gamma \in (1,2]$ and where the edge joining $x$ to its parent has rescaled initial weight $d(\rho,…

Probability · Mathematics 2025-09-30 George Andriopoulos , Eleanor Archer

Since the work of Aldous and Pitman (1998), several authors have studied the pruning processes of Galton-Watson trees and their continuous analogue L\'evy trees. L\"ohr, Voisin and Winter (2015) introduced the space of bi-measure…

Probability · Mathematics 2025-11-04 Gabriel Berzunza Ojeda , Anita Winter

We investigate conditioning Galton-Watson trees on general recursive-type events, such as the event that the tree survives until a specific level. It turns out that the conditioned tree is again a type of Galton-Watson tree, with different…

Probability · Mathematics 2014-12-19 Eric Cator , Henk Don

The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is…

Probability · Mathematics 2010-04-27 Russell Lyons , Ron Peled , Oded Schramm

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

Probability · Mathematics 2012-10-24 David A. Croydon , Takashi Kumagai

Consider any supercritical Galton-Watson process which may become extinct with positive probability. It is a well-understood and intuitively obvious phenomenon that, on the survival set, the process may be pathwise decomposed into a…

Probability · Mathematics 2013-04-09 A. E. Kyprianou , J-L. Perez , Y-X. Ren

We consider a recurrent random walk on a rooted tree in random environment given by a branching random walk. Up to the first return to the root, its edge local times form a Multi-type Galton-Watson tree with countably infinitely many types.…

Probability · Mathematics 2020-10-02 Xinxin Chen , Loïc de Raphélis

In this paper we consider inhomogeneous Galton-Watson trees, and derive various moments for such processes: the number of vertices, the number of leaves, and the height of the tree. Also we make a simple condition of finiteness. We use…

Applications · Statistics 2025-05-09 Jakob G. Rasmussen , Troels Pedersen , Rasmus L. Olsen

In this note we consider both the local maximal out-degree and the global maximal out-degree of Galton-Watson trees. In particular, we show that the tail of any local maximal out-degree and that of the offspring distribution are…

Probability · Mathematics 2015-03-10 Xin He

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

We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…

Probability · Mathematics 2012-03-20 David A. Croydon , Alexander Fribergh , Takashi Kumagai

We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…

Probability · Mathematics 2022-07-05 Souvik Ray , Rajat Subhra Hazra , Parthanil Roy , Philippe Soulier

We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the…

Probability · Mathematics 2016-05-18 Adam Bowditch

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

Probability · Mathematics 2018-06-20 Olivier Hénard , Pascal Maillard

As well known, for a supercritical Galton-Watson process $Z_n$ whose offspring distribution has mean $m>1$, the ratio $W_n:=Z_n/m^n$ has a.s. limit, say $W$. We study tail behaviour of the distributions of $W_n$ and $W$ in the case where…

Probability · Mathematics 2013-03-12 Denis Denisov , Dmitry Korshunov , Vitali Wachtel

We consider the bifurcating Markov chain model introduced by Guyon to detect cellular aging from cell lineage. To take into account the possibility for a cell to die, we use an underlying Galton-Watson process to describe the evolution of…

Probability · Mathematics 2008-07-08 Jean-François Delmas , Laurence Marsalle

Consider a critical Galton--Watson branching process with immigration, where the offspring distribution belongs to the domain of attraction of a $(1 + \alpha)$-stable law with $\alpha \in (0,1)$, and the immigration distribution either (i)…

Probability · Mathematics 2025-10-03 Peter Kevei , Kata Kubatovics

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

Probability · Mathematics 2012-05-03 Alan Hammond