Addario-Berry, LouigiBrandenberger, AnnaBriend, SimonBroutin, NicolasLugosi, Gábor2025-11-272025-11-272025Addario-Berry L, Brandenberger A, Briend S, Broutin N, Lugosi G. Leaf stripping on uniform attachment trees. Random Struct Algorithms. 2025;67(1):e70023. DOI: 10.1002/rsa.700231042-9832http://hdl.handle.net/10230/72043In 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 − 𝜀, the set of remaining vertices contains the root and has a size only depending on 𝜀 but not on the size of the tree.application/pdfengThis is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited. © 2025 The Author(s). Random Structures & Algorithms published byWiley Periodicals LLC.info:eu-repo/semantics/article2025-11-27http://dx.doi.org/10.1002/rsa.70023Pólya urnsRandom recursive treesRandom treesRoot-finding algorithmsRoot reconstructionUniform attachmentinfo:eu-repo/semantics/openAccess