Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
Preprint
Abstract
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 attraction of a stable law. This extends results obtained for the height and width by Addario-Berry, Devroye & Janson in the finite variance case.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Random Walk on Random Infinite LooptreesJournal of Statistical Physics, 2015
- The CRT is the scaling limit of random dissectionsRandom Structures & Algorithms, 2014
- Random non‐crossing plane configurations: A conditioned Galton‐Watson tree approachRandom Structures & Algorithms, 2012
- Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered treesThe Annals of Probability, 2012
- Scaling limits of random planar maps with large facesThe Annals of Probability, 2011
- Random cutting and records in deterministic and random treesRandom Structures & Algorithms, 2005
- Statistics on non-crossing treesDiscrete Mathematics, 2002
- Extreme order statistics on Galton-Watson treesMetrika, 1998
- Some new limit theorems for the critical branching process allowing immigrationStochastic Processes and their Applications, 1976
- A branching process with mean one and possibly infinite varianceProbability Theory and Related Fields, 1968