English
Related papers

Related papers: Quenched critical percolation on Galton-Watson tre…

200 papers

Consider a population evolving as a critical continuous-time Galton-Watson (GW) tree. Conditional on the population surviving until a large time $T$, sample $k$ individuals uniformly at random (without replacement) from amongst those alive…

Probability · Mathematics 2023-02-07 Simon C. Harris , Samuel G. G. Johnston , Juan Carlos Pardo

Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…

Probability · Mathematics 2019-02-14 Simon C. Harris , Samuel G. G. Johnston , Matthew I. Roberts

We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…

Probability · Mathematics 2015-09-29 Yueyun Hu , Zhan Shi

We consider random walks in dynamic random environments which arise naturally as spatial embeddings of ancestral lineages in spatial locally regulated population models. In particular, as the main result, we prove the quenched central limit…

Probability · Mathematics 2024-03-15 Matthias Birkner , Andrej Depperschmidt , Timo Schlüter

We are interested in the structure of multitype Bienaym\'e-Galton-Watson (BGW) trees conditioned on integer linear combinations of the numbers of vertices of given types. We show that, under regularity assumptions on the offspring…

Probability · Mathematics 2025-03-17 Rémy Poudevigne , Paul Thévenin

We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components…

Probability · Mathematics 2016-08-11 Daphné Dieuleveut

In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…

Probability · Mathematics 2021-11-24 Tianyi Bai , Pierre Rousselin

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

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 branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…

Probability · Mathematics 2014-04-16 Wei Su

Branching processes pervade many models in statistical physics. We investigate the survival probability of a Galton-Watson branching process after a finite number of generations. We reveal the finite-size scaling law of the survival…

Statistical Mechanics · Physics 2015-11-26 Rosalba Garcia-Millan , Francesc Font-Clos , Alvaro Corral

Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…

Probability · Mathematics 2015-06-18 Jakob E. Björnberg , Sigurdur Örn Stefánsson

We give a simple new proof of a theorem of Duquesne, stating that the properly rescaled contour function of a critical aperiodic Galton-Watson tree, whose offspring distribution is in the domain of attraction of a stable law of index…

Probability · Mathematics 2014-11-14 Igor Kortchemski

We consider a branching random walk initiated by a single particle at location 0 in which particles alternately reproduce according to the law of a Galton-Watson process and disperse according to the law of a driftless random walk on the…

Probability · Mathematics 2014-03-31 Steven P. Lalley , Yuan Shao

We study a particular type of subcritical Galton--Watson trees, which are called non-generic trees in the physics community. In contrast with the critical or supercritical case, it is known that condensation appears in certain large…

Probability · Mathematics 2018-02-19 Igor Kortchemski

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 discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…

Probability · Mathematics 2018-02-09 Benedikt Stufler

We continue our study of the distribution of the maximal number $X^{\ast}_k$ of offsprings amongst all individuals in a critical Galton-Watson process started with $k$ ancestors, treating the case when the reproduction law has a regularly…

Probability · Mathematics 2012-09-19 Jean Bertoin

A Galton-Watson process in a varying environment is a discrete time branching process where the offspring distributions vary among generations. It is known that in the critical case, these processes have a Yaglom limit, that is, a suitable…

Probability · Mathematics 2024-10-03 Natalia Cardona-Tobón , Arturo Jaramillo , Sandra Palau

Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…

Probability · Mathematics 2013-07-23 Jean Bertoin , Grégory Miermont