2000 character limit reached
Leaf Stripping on Uniform Attachment Trees (2410.06481v1)
Published 9 Oct 2024 in math.PR, cs.DS, cs.LG, and stat.ML
Abstract: In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with probability $1 - \epsilon$, the set of remaining vertices contains the root and has a size only depending on $\epsilon$ but not on the size of the tree.