Scaling limits of multitype Bienaymé trees
Preprint
Abstract
We consider critical multitype Bienaymé trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first, conditioning on the value of a linear combination of the numbers of vertices of given types; and second, conditioning on the precise number of vertices belonging to a selected subset of types. We prove that, under a finite exponential moment condition, the scaling limit as the tree size tends to infinity is given by the Brownian Continuum Random Tree. Additionally, we establish strong non-asymptotic tail bounds for the height of such trees. Our main tools include a flattening operation applied to multitype trees and sharp estimates regarding the structure of monotype trees with a given sequence of degrees.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Poisson–Dirichlet Scaling Limits of Kemp’s SupertreesJournal of Theoretical Probability, 2025
- Limits of Chordal Graphs With Bounded Tree‐WidthRandom Structures & Algorithms, 2025
- Scaling limits of multi-type Markov Branching treesProbability Theory and Related Fields, 2021
- Rerooting Multi-type Branching Trees: The Infinite Spine CaseJournal of Theoretical Probability, 2021
- Local Convergence of Large Critical Multi-type Galton–Watson Trees and Applications to Random MapsJournal of Theoretical Probability, 2016
- Sub-exponential tail bounds for conditioned stable Bienaymé–Galton–Watson treesProbability Theory and Related Fields, 2016
- A Course on Large Deviations with an Introduction to Gibbs Measures2015
- The CRT is the scaling limit of random dissectionsRandom Structures & Algorithms, 2014
- The Methods of Distances in the Theory of Probability and Statistics2013
- Asymptotics of trees with a prescribed degree sequence and applicationsRandom Structures & Algorithms, 2012