On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM

DOI10.1017/apr.2021.42zbMath1490.05002OpenAlexW4282023542MaRDI QIDQ5084788

Miklós Bóna, Boris G. Pittel

Publication date: 28 June 2022

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/apr.2021.42

zbMATH Keywords

distributiondistancerankroot

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Asymptotic enumeration (05A16) Structure theory of lattices (06B05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM