English
Related papers

Related papers: Local convergence of critical random trees and con…

200 papers

We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…

Probability · Mathematics 2024-07-24 Eleanor Archer , Quirin Vogel

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

Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…

Probability · Mathematics 2024-10-24 Rodrigo B. Alves , Yuri F. Saporito , Luiz M. Carvalho

We show that the local limit of unicellular maps whose genus is proportional to the number of edges is a supercritical geometric Galton-Watson tree conditioned to survive. The proof relies on enumeration results obtained via the recent…

Probability · Mathematics 2015-05-20 Omer Angel , Guillaume Chapuy , Nicolas Curien , Gourab Ray

A recurrent graph $G$ has the infinite collision property if two independent random walks on $G$, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this…

Probability · Mathematics 2010-03-18 Martin T. Barlow , Yuval Peres , Perla Sousi

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

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

We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…

Probability · Mathematics 2025-10-28 Daniel Lacker , Kavita Ramanan , Ruoyu Wu

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

Probability · Mathematics 2021-12-07 Ágnes Backhausz , Charles Bordenave , Balázs Szegedy

Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett , Svante Janson

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 show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, agrees up to generation $K$ with a regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring distribution and…

Probability · Mathematics 2012-04-16 Nathanael Berestycki , Nina Gantert , Peter Morters , Nadia Sidorova

Given a general critical or sub-critical branching mechanism, we define a pruning procedure of the associated L\'evy continuum random tree. This pruning procedure is defined by adding some marks on the tree, using L\'evy snake techniques.…

Probability · Mathematics 2011-01-27 Romain Abraham , Jean-Francois Delmas , Guillaume Voisin

Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…

Probability · Mathematics 2020-08-26 Amaury Lambert , Gerónimo Uribe Bravo

Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…

Probability · Mathematics 2020-06-11 Tobias Johnson , Moumanti Podder , Fiona Skerman

Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…

Probability · Mathematics 2022-08-05 Tobias Johnson

We introduce and study a model of plane random trees generalizing the famous Bienaym\'e--Galton--Watson model but where births and deaths are locally correlated. More precisely, given a random variable $(B,H)$ with values in $\{1,2,3,…

Probability · Mathematics 2025-11-21 Ariane Carrance , Jérôme Casse , Nicolas Curien

We consider the genealogical tree of a stationary continuous state branching process with immigration. For a sub-critical stable branching mechanism, we consider the genealogical tree of the extant population at some fixed time and prove…

Probability · Mathematics 2020-05-21 Romain Abraham , Jean-François Delmas , Hui He

In this work, we study asymptotics of multitype Galton-Watson trees with finitely many types. We consider critical and irreducible offspring distributions such that they belong to the domain of attraction of a stable law, where the…

Probability · Mathematics 2016-07-20 Gabriel Berzunza

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

Probability · Mathematics 2020-07-01 Jacopo Borga , Mathilde Bouvel , Valentin Féray , Benedikt Stufler