{"docId":9237,"paperId":7515,"url":"https:\/\/dmtcs.episciences.org\/7515","doi":"10.46298\/dmtcs.7515","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":608,"name":"vol. 24, no. 1"}],"section":[{"sid":2,"title":"Analysis of Algorithms","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"2105.12046","repositoryVersion":3,"repositoryLink":"https:\/\/arxiv.org\/abs\/2105.12046v3","dateSubmitted":"2021-05-26 16:41:43","dateAccepted":"2022-02-19 09:06:38","datePublished":"2022-03-30 11:17:27","titles":["Leaf multiplicity in a Bienaym\\'e-Galton-Watson tree"],"authors":["Brandenberger, Anna M.","Devroye, Luc","Goh, Marcel K.","Zhao, Rosie Y."],"abstracts":["This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaym\\'e-Galton-Watson tree with critical offspring distribution $\\xi$, conditioned on the tree being of size $n$. In particular, we show that if $S_n$ is the maximum multiplicity in a conditional Bienaym\\'e-Galton-Watson tree, then $S_n = \\Omega(\\log n)$ asymptotically in probability and under the further assumption that ${\\bf E}\\{2^\\xi\\} < \\infty$, we have $S_n = O(\\log n)$ asymptotically in probability as well. Explicit formulas are given for the constants in both bounds. We conclude by discussing links with an alternate definition of multiplicity that arises in the root-estimation problem.","Comment: 17 pages, 6 figures, final journal version"],"keywords":["Mathematics - Probability"]}