Analysis reveals that a leaf-stripping algorithm retains the root in vertices, suggesting efficient performance.
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 , the set of remaining vertices contains the root and has a size only depending on but not on the size of the tree.
No takes yet. Share an insight, caveat, or question.
Addario‐Berry et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: