Sub-exponential tail bounds for conditioned stable Bienaymé–Galton–Watson trees
- 13 April 2016
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 168 (1-2) , 1-40
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Agence Nationale de la Recherche (ANR-14-CE25-0014 (ANR GRAAL))
- City of Paris (Emergences Paris 2013, Combinatoire à Paris)
This publication has 31 references indexed in Scilit:
- Asymptotics of trees with a prescribed degree sequence and applicationsRandom Structures & Algorithms, 2012
- Simply generated trees, conditioned Galton–Watson trees, random allocations and condensationProbability Surveys, 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
- Random trees and applicationsProbability Surveys, 2005
- A limit theorem for the contour process of condidtioned Galton--Watson treesThe Annals of Probability, 2003
- Noncrossing trees are almost conditioned Galton–Watson treesRandom Structures & Algorithms, 2001
- Branching processes in Lévy processes: the exploration processThe Annals of Probability, 1998
- Conceptual Proofs of $L$ Log $L$ Criteria for Mean Behavior of Branching ProcessesThe Annals of Probability, 1995
- A branching process with mean one and possibly infinite varianceProbability Theory and Related Fields, 1968