Hostname: page-component-54dcc4c588-sq2k7 Total loading time: 0 Render date: 2025-10-01T09:57:04.109Z Has data issue: false hasContentIssue false
  • English
  • Français

Conditioning Bienaymé–Galton–Watson trees to have large sub-populations

Part of: Probability theory on algebraic and topological structures Markov processes

Published online by Cambridge University Press:  10 September 2025

Romain Abraham ,
Hongwei Bi  and
Jean-François Delmas
Romain Abraham*
Affiliation:
Université d’Orléans, Université de Tours, CNRS
Hongwei Bi*
Affiliation:
University of International Business and Economics
Jean-François Delmas*
Affiliation:
École des Ponts
*
*Postal address: Institut Denis Poisson, Université d’Orléans, Université de Tours, CNRS, Tours, France. Email: romain.abraham@univ-orleans.fr
*Postal address: Institut Denis Poisson, Université d’Orléans, Université de Tours, CNRS, Tours, France. Email: romain.abraham@univ-orleans.fr
*Postal address: Institut Denis Poisson, Université d’Orléans, Université de Tours, CNRS, Tours, France. Email: romain.abraham@univ-orleans.fr
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the local limit in distribution of Bienaymé–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 Kesten’s tree associated with a certain critical offspring distribution.

Keywords

Bienaymé–Galton–Watson treegeneric probability distributionlocal limit

MSC classification

Primary: 60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Secondary: 60B10: Convergence of probability measures

Information

Type
Original Article
Information
Advances in Applied Probability , First View , pp. 1 - 42
Check for updates
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Abraham, R., Bouaziz, A. and Delmas, J.-F. (2017). Local limits of Galton-Watson trees conditioned on the number of protected nodes. J. Appl. Prob. 54, 55–65.10.1017/jpr.2016.86CrossRefGoogle Scholar
Abraham, R., Bouaziz, A. and Delmas, J.-F. (2020). Very fat geometric Galton-Watson trees. ESAIM: Prob. Statist. 24, 294–314.10.1051/ps/2019026CrossRefGoogle Scholar
Abraham, R. and Delmas, J.-F. (2014). Local limits of conditioned Galton-Watson trees: the condensation case. Electron. J. Prob. 19, 1–29.Google Scholar
Abraham, R. and Delmas, J.-F. (2014). Local limits of conditioned Galton-Watson trees: the infinite spine case. Electron. J. Prob. 19, 1–19.Google Scholar
Abraham, R. and Delmas, J.-F. (2015). An introduction to Galton-Watson trees and their local limits. Preprint. Available at https://arxiv.org/abs/1506.05571.Google Scholar
Abraham, R. and Delmas, J.-F. (2019). Asymptotic properties of expansive Galton-Watson trees. Electron. J. Prob. 24, 1–51.CrossRefGoogle Scholar
Abraham, R., Delmas, J.-F. and Guo, H. (2018). Critical multi-type Galton-Watson trees conditioned to be large. J. Theoret. Prob. 31, 757–788.10.1007/s10959-016-0739-8CrossRefGoogle Scholar
Aldous, D. (1991). The continuum random tree. I. Ann. Prob. 19, 1–28.Google Scholar
Curien, N. and Kortchemski, I. (2014). Random non-crossing plane configurations: A conditioned Galton-Watson tree approach. Random Struct. Algorithms 45, 236–260.10.1002/rsa.20481CrossRefGoogle Scholar
Deutsch, E. (1999). Dyck path enumeration. Discrete Math. 204, 167–202.10.1016/S0012-365X(98)00371-9CrossRefGoogle Scholar
Duquesne, T. and Le Gall, J.-F. (2002). Random trees, Lévy Processes and Spatial Branching Processes. Astérisque vi+147.Google Scholar
Durhuus, B. and Ünel, M. (2023). Trees with exponential height dependent weight. Prob. Theory Related Fields 186, 999–1043.10.1007/s00440-023-01188-7CrossRefGoogle Scholar
Geiger, J. and Kauffmann, L. (2004). The shape of large Galton-Watson trees with possibly infinite variance. Random Struct. Algorithms 25, 311–335.10.1002/rsa.20021CrossRefGoogle Scholar
He, X. (2017). Conditioning Galton-Watson trees on large maximal outdegree. J. Theoret. Prob. 30, 842–851.CrossRefGoogle Scholar
He, X. (2022). Local convergence of critical random trees and continuous-state branching processes. J. Theoret. Prob. 35, 685–713.CrossRefGoogle Scholar
Janson, S. (2012). Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation. Prob. Surv. 9, 103–252.10.1214/11-PS188CrossRefGoogle Scholar
Janson, S. (2016). Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. Random Struct. Algorithms 48, 57–101.CrossRefGoogle Scholar
Jonsson, T. and Stefánsson, S. Ö. (2011). Condensation in nongeneric trees. J. Statist. Phys. 142, 277–313.CrossRefGoogle Scholar
Kargin, V. (2023). Scaling limits of slim and fat trees. J. Theoret. Prob. 36, 2192–2228.10.1007/s10959-023-01261-wCrossRefGoogle Scholar
Kennedy, D. P. (1975). The Galton-Watson process conditioned on the total progeny. J. Appl. Prob. 12, 800–806.10.2307/3212730CrossRefGoogle Scholar
Kesten, H. (1986). Subdiffusive behavior of random walk on a random cluster. Ann. Inst. H. Poincaré Prob. Statist. 22, 425–487.Google Scholar
Kortchemski, I. and Marzouk, C. (2023). Large deviation local limit theorems and limits of biconditioned planar maps. Ann. Appl. Prob. 33, 3755–3802.10.1214/22-AAP1906CrossRefGoogle Scholar
Marzouk, C. (2022). On scaling limits of random trees and maps with a prescribed degree sequence. Ann. H. Lebesgue 5, 317–386.10.5802/ahl.125CrossRefGoogle Scholar
Neveu, J. (1986). Arbres et processus de Galton-Watson. Ann. Inst. H. Poincaré Prob. Statist. 22, 199–207.Google Scholar
Pénisson, S. (2016). Beyond the Q-process: various ways of conditioning the multitype Galton-Watson process. Latin Amer. J. Prob. Math. Statist. 13, 223–237.10.30757/ALEA.v13-09CrossRefGoogle Scholar
Poudevigne, R. and Thévenin, P. (2025). Existence of critical tiltings and local limits of general size-conditioned Bienaymé-Galton-Watson multitype trees. Preprint. Available at https://arxiv.org/abs/2503.11501.Google Scholar
Rizzolo, D. (2015). Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set. Ann. Inst. H. Poincaré Prob. Statist. 51, 512–532.10.1214/13-AIHP594CrossRefGoogle Scholar
Stephenson, R. (2018). Local convergence of large critical multi-type Galton-Watson trees and applications to random maps. J. Theoret. Prob. 31, 159–205.CrossRefGoogle Scholar
Stufler, B. (2019). Local limits of large Galton-Watson trees rerooted at a random vertex. Ann. Inst. H. Poincaré Prob. Statist. 55, 155–183.10.1214/17-AIHP879CrossRefGoogle Scholar
Thévenin, P. (2020). Vertices with fixed outdegrees in large Galton-Watson trees. Electron. J. Prob. 25, 1–25.CrossRefGoogle Scholar
Thévenin, P. (2023). Critical exponential tiltings for size-conditioned multitype Bienaymé–Galton–Watson trees. Preprint. Available at https://arxiv.org/abs/2310.12897.Google Scholar
Zhu, H., Li, Z. and Hayashi, M. (2022). Nearly tight universal bounds for the binomial tail probabilities. Preprint. Available at https://arxiv.org/abs/2211.01688.Google Scholar