Limits of biconditioned Bienayme-Galton-Watson trees
Probability
2026-02-06 v2 Combinatorics
Abstract
We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with respect to the offspring distribution. In contrast, the second case leads to a variety of limiting behaviors, ranging from condensation phenomena to more elongated tree structures, depending on the properties of the offspring distribution. To prove these results, we use tools from conditioned random walk theory and from analytic combinatorics.
Keywords
Cite
@article{arxiv.2507.22135,
title = {Limits of biconditioned Bienayme-Galton-Watson trees},
author = {Vanessa Dan},
journal= {arXiv preprint arXiv:2507.22135},
year = {2026}
}
Comments
Updated version. Minor revisions in Section 3.2 (Theorem 3.4 and its proof)