Random increasing plane trees: asymptotic enumeration of vertices by distance from leaves
M Bóna, B Pittel - arXiv preprint arXiv:2108.04989, 2021 - arxiv.org
We prove that for any fixed $ k $, the probability that a random vertex of a random increasing
plane tree is of rank $ k $, that is, the probability that a random vertex is at distance $ k …
plane tree is of rank $ k $, that is, the probability that a random vertex is at distance $ k …