Leaf Stripping on Uniform Attachment Trees

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-\hat{I}\mu$, the set of remaining vertices contains the root and has a size only depending on $\hat{I}\mu$ but not on the size of the tree.

9 pages, 5 figures