English
Related papers

Related papers: Conditioned multi-type Galton-Watson trees

200 papers

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

A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…

Probability · Mathematics 2020-03-24 Nicolas Broutin , Luc Devroye , Nicolas Fraiman

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 study the local limit in distribution of Bienaym{\'e}-Galton-Watson trees conditioned on having large sub-populations. Assuming a generic and aperiodic condition on the offspring distribution, we prove the existence of a limit given by a…

Probability · Mathematics 2023-11-30 Romain Abraham , Hongwei Bi , Jean-François Delmas

Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…

Statistics Theory · Mathematics 2013-07-24 Serdar Altok

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 consider conditioned Galton-Watson trees and show asymptotic normality of additive functionals that are defined by toll functions that are not too large. This includes, as a special case, asymptotic normality of the number of fringe…

Probability · Mathematics 2013-12-05 Svante Janson

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 model of random loops on Galton-Watson trees with an offspring distribution with high expectation. We give the configurations a weighting of $\theta^{\#\text{loops}}$. For many $\theta>1$ these models are equivalent to certain…

Mathematical Physics · Physics 2018-12-05 Volker Betz , Johannes Ehlert , Benjamin Lees

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 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 consider the set of random Bienaym\'e-Galton-Watson trees with a bounded number of offspring and bounded number of generations as a statistical mechanics model: a random tree is a rooted subtree of the maximal tree; the spin at a given…

Mathematical Physics · Physics 2022-10-26 Francois Dunlop , Arif Mardin

We give a realization of the stable L\'evy forest of a given size conditioned by its mass from the path of the unconditioned forest. Then, we prove an invariance principle for this conditioned forest by considering $k$ independent…

Probability · Mathematics 2007-06-19 Loic Chaumont , Juan Carlos Pardo Millan

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

Probability · Mathematics 2023-04-11 Christoffer Olsson

We introduce a certain class of 2-type Galton-Watson trees with edge lengths. We prove that, after an adequate rescaling, the weighted height function of a forest of such trees converges in law to the reflected Brownian motion. We then use…

Probability · Mathematics 2015-11-03 Loïc de Raphelis

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 explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…

Probability · Mathematics 2021-07-01 Svante Janson

The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…

Statistics Theory · Mathematics 2008-11-17 Peter Jagers , Serik Sagitov

A multitype Dawson-Watanabe process is conditioned, in subcritical and critical cases, on non-extinction in the remote future. On every finite time interval, its distribution is absolutely continuous with respect to the law of the…

Probability · Mathematics 2011-12-05 Nicolas Champagnat , Sylvie Roelly

We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels…

Combinatorics · Mathematics 2008-06-05 Silvia Bacchelli , Luca Ferrari , Renzo Pinzani , Renzo Sprugnoli