English
Related papers

Related papers: Limit theorems for conditioned non-generic Galton-…

200 papers

We provide a complete picture of the local convergence of critical or subcritical Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set. The generic case, where the limit is a random tree with…

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

We consider a Galton-Watson tree where each node is marked independently of each others with a probability depending on its outdegree. We give a complete picture of the local convergence of critical or sub-critical marked Galton-Watson…

Probability · Mathematics 2025-09-29 Romain Abraham , Sonia Boulal , Pierre Debs

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 give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…

Probability · Mathematics 2011-12-05 Svante Janson

We study $S(\mathcal T_{n})$, the number of subtrees in a conditioned Galton--Watson tree of size $n$. With two very different methods, we show that $\log(S(\mathcal T_{n}))$ has a Central Limit Law and that the moments of $S(\mathcal…

Combinatorics · Mathematics 2020-04-21 Xing Shi Cai , Svante Janson

We study nongeneric planar trees and prove the existence of a Gibbs measure on infinite trees obtained as a weak limit of the finite volume measures. It is shown that in the infinite volume limit there arises exactly one vertex of infinite…

Statistical Mechanics · Physics 2011-01-05 Thordur Jonsson , Sigurdur Orn Stefansson

We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with…

Probability · Mathematics 2014-12-08 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

The aim of this lecture is to give an overview of old and new resultson Bienaym\'e-Galton-Watson (BGW) trees. After introducing the framework of discretetrees, we first give alternative proofs of classical results on theextinction…

Probability · Mathematics 2024-09-19 Romain Abraham , Jean-François Delmas

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

We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…

Probability · Mathematics 2026-02-06 Vanessa Dan

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 are interested in the structure of large Bienaym\'e-Galton-Watson random trees whose offspring distribution is critical and falls within the domain of attraction of a stable law of index $\alpha=1$. In stark contrast to the case $\alpha…

Probability · Mathematics 2018-11-22 Igor Kortchemski , Loïc Richier

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

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 study various models of random non-crossing configurations consisting of diagonals of convex polygons, and focus in particular on uniform dissections and non-crossing trees. For both these models, we prove convergence in distribution…

Probability · Mathematics 2014-11-14 Nicolas Curien , Igor Kortchemski

We consider multi-type Galton Watson trees, and find the distribution of these trees when conditioning on very general types of recursive events. It turns out that the conditioned tree is again a multi-type Galton Watson tree, possibly with…

Probability · Mathematics 2015-07-23 Eric Cator , Henk Don

We are interested in nodes with fixed outdegrees in large conditioned Galton--Watson trees. We first study the scaling limits of processes coding the evolution of the number of such nodes in different explorations of the tree…

Probability · Mathematics 2020-02-27 Paul Thévenin

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

Probability · Mathematics 2007-05-23 Jean-Francois Le Gall

We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for…

Probability · Mathematics 2014-11-14 Igor Kortchemski
‹ Prev 1 2 3 10 Next ›