English
Related papers

Related papers: Growing conditioned BGW trees with log-concave off…

200 papers

We consider a branching random walk on a multi($Q$)-type, supercritical Galton-Watson tree which satisfies Kesten-Stigum condition. We assume that the displacements associated with the particles of type $Q$ have regularly varying tails of…

Probability · Mathematics 2019-09-25 Ayan Bhattacharya , Krishanu Maulik , Zbigniew Palmowski , Parthanil Roy

Consider a branching random walk, where the branching mechanism is governed by a Galton-Watson process, and the migration by a finite range symmetric irreducible random walk on the integer lattice $\mathbb{Z}^d$. Let $Z_n(z)$ be the number…

Probability · Mathematics 2021-06-09 Zhi-qiang Gao

We define symmetric and asymmetric branching trees, a class of processes particularly suited for modeling genealogies of inhomogeneous populations where individuals may reproduce throughout life. In this framework, a broad class of…

Probability · Mathematics 2025-10-10 Frederik M. Andersen , Marc A. Suchard , Carsten Wiuf , Samir Bhatt

The Kesten-Stigum Theorem is a fundamental criterion for the rate of growth of a supercritical branching process, showing that an L log L condition is decisive. In critical and subcritical cases, results of Kolmogorov and later authors give…

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

In this paper we study the recurrence and transience of the $\mathbb{Z}^d$-valued branching random walk in random environment indexed by a critical Bienaym\'e-Galton-Watson tree, conditioned to survive. The environment is made either of…

Probability · Mathematics 2025-01-03 Alexandre Legrand , Christophe Sabot , Bruno Schapira

An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, as has been shown in a special case by Luczak and Winkler.

Probability · Mathematics 2007-05-23 Svante Janson

We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…

Probability · Mathematics 2015-08-11 Xin He

We study the additive functional $X_n(\alpha)$ on conditioned Galton-Watson trees given, for arbitrary complex $\alpha$, by summing the $\alpha$th power of all subtree sizes. Allowing complex $\alpha$ is advantageous, even for the study of…

Probability · Mathematics 2021-04-08 James Allen Fill , Svante Janson

The study of Gaussian free field level sets on supercritical Galton-Watson trees has been initiated by Ab\"acherli and Sznitman in Ann. Inst. Henri Poincar\'{e} Probab. Stat., 54(1):173--201, 2018. By means of entirely different tools, we…

Probability · Mathematics 2024-09-04 Alexander Drewitz , Gioele Gallo , Alexis Prévost

Trees in Brownian excursions have been studied since the late 1980s. Forests in excursions of Brownian motion above its past minimum are a natural extension of this notion. In this paper we study a forest-valued Markov process which…

Probability · Mathematics 2007-05-23 Jim Pitman , Matthias Winkel

We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…

Probability · Mathematics 2014-07-22 Louigi Addario-Berry , Luc Devroye , Svante Janson

Consider a sequence (Z_n,Z_n^M) of bivariate L\'evy processes, such that Z_n is a spectrally positive L\'evy process with finite variation, and Z_n^M is the counting process of marks in {0,1} carried by the jumps of Z_n. The study of these…

Probability · Mathematics 2014-03-11 Cécile Delaporte

Let ${\cal T}$ be a rooted Galton-Watson tree with offspring distribution $\{p_k\}$ that has $p_0=0$, mean $m=\sum kp_k>1$ and exponential tails. Consider the $\lambda$-biased random walk $\{X_n\}_{n\geq 0}$ on ${\cal T}$; this is the…

Probability · Mathematics 2007-05-23 Yuval Peres , Ofer Zeitouni

Using the LePage representation, a strictly stable random element in a Banach space with $\alpha\in(0,2)$ can be represented as a sum of points of a Poisson process. This point process is union-stable, i.e. the union of its two independent…

Probability · Mathematics 2007-05-23 Youri Davydov , Ilya Molchanov , Sergei Zuyev

We discuss interplays between log-concave functions and log-concave sequences. We prove a Bernstein-type theorem, which characterizes the Laplace transform of log-concave measures on the half-line in terms of log-concavity of the…

Probability · Mathematics 2018-07-10 Bo'az Klartag , Joseph Lehec

We prove that, for (adapted) stationary processes, the so-called Maxwell-Wood-roofe condition is sufficient for the law of the iterated logarithm and that it is optimal in some sense. We obtain a similar conclusion concerning the…

Probability · Mathematics 2016-01-26 Christophe Cuny

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 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

This paper continues the research project launched in [Constr. Approx. (2025) https://doi.org/10.1007/s00365-023-09675-9] and aimed at studying time-inhomogeneous one-dimensional branching processes (mainly on a continuous but also on a…

Probability · Mathematics 2025-12-16 Pavel Gumenyuk , Takahiro Hasebe , José-Luis Pérez

We consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…

Probability · Mathematics 2008-12-18 Luc Devroye , Svante Janson