English
Related papers

Related papers: Leaf multiplicity in a Bienaym\'e-Galton-Watson tr…

200 papers

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 prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

Probability · Mathematics 2023-12-08 Gabriel Berzunza Ojeda , Cecilia Holmgren , Svante Janson

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

Discrete Mathematics · Computer Science 2016-08-16 Frédéric Chyzak , Michael Drmota , Thomas Klausner , Gerard Kok

The Horton-Strahler number of a tree is a measure of its branching complexity; it is also known in the literature as the register function. We show that for critical Galton-Watson trees with finite variance conditioned to be of size $n$,…

Probability · Mathematics 2025-06-04 Anna M. Brandenberger , Luc Devroye , Tommy Reddad

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

We give an invariance principle for very general additive functionals of conditioned Bienaym{\'e}-Galton-Watson trees in the global regime when the offspring distribution lies in the domain of attraction of a stable distribution, the limit…

Probability · Mathematics 2020-09-18 Romain Abraham , Jean-François Delmas , Michel Nassif

We consider a multitype Galton-Watson process that allows for the mutation and reversion of individual types in discrete and continuous time. In this setting, we explicitly compute the time evolution of quantities such as the mean and…

Populations and Evolution · Quantitative Biology 2026-01-01 Qiao Huang , Nicolas Privault

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

Under minimal condition, we prove the local convergence of a critical multi-type Galton-Watson tree conditioned on having a large total progeny by types towards a multi-type Kesten's tree. We obtain the result by generalizing Neveu's strong…

Probability · Mathematics 2016-09-28 Romain Abraham , Jean-François Delmas , Hongsong Guo

The controlled branching process is a generalization of the classical Bienaym\'e-Galton-Watson branching process. It is a useful model for describing the evolution of populations in which the population size at each generation needs to be…

Statistics Theory · Mathematics 2015-02-09 M. Gonzalez , C. Minuesa , I. del Puerto

We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…

Combinatorics · Mathematics 2018-09-13 Pratik Misra , Seth Sullivant

We consider random walks indexed by arbitrary finite random or deterministic trees. We derive a simple sufficient criterion which ensures that the maximal displacement of the tree-indexed random walk is determined by a single large jump.…

Probability · Mathematics 2018-06-20 Pascal Maillard

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 introduce a notion of finite sampling consistency for phylogenetic trees and show that the set of finitely sampling consistent and exchangeable distributions on n leaf phylogenetic trees is a polytope. We use this polytope to show that…

Combinatorics · Mathematics 2019-03-06 Ben Hollering , Seth Sullivant

Given two phylogenetic trees with the $\{1, \ldots, n\}$ leaf-set the maximum agreement subtree problem asks what is the maximum size of the subset $A \subseteq \{1, \ldots, n\}$ such that the two trees are equivalent when restricted to…

Combinatorics · Mathematics 2018-12-18 Alexey Markin

We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…

Probability · Mathematics 2017-12-14 Romain Abraham , Jean-François Delmas

We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…

Probability · Mathematics 2019-04-17 Josh Rosenberg

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 establish uniform sub-exponential tail bounds for the width, height and maximal outdegree of critical Bienaym\'e-Galton-Watson trees conditioned on having a large fixed size, whose offspring distribution belongs to the domain of…

Probability · Mathematics 2018-02-19 Igor Kortchemski

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…

Probability · Mathematics 2022-04-26 Louigi Addario-Berry , Anna Brandenberger , Jad Hamdan , Céline Kerriou