We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Leaf Stripping on Uniform Attachment Trees

Thumbnail Image
Download
Name

Random Struct Algorithms - 2025 - Addario‐Berry - Leaf Stripping on Uniform Attachment Trees.pdf

Size

348.06 KB

Format

Adobe PDF

Checksum (MD5)

a299d0a072bffa8a1b737b9ac315d28c

Author(s)
Addario‐Berry, Louigi
•
Brandenberger, Anna
•
Briend, Simon
•
Broutin, Nicolas
•
Lugosi, Gábor
Date Issued
August 4, 2025
Journal
Random Structures & Algorithms
Publisher
Wiley
Citation
Addario-Berry, L., Brandenberger, A., Briend, S., Broutin, N. and Lugosi, G. (2025), Leaf Stripping on Uniform Attachment Trees. Random Struct Alg, 67: e70023.
Version
Final published version
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 − 𝜀, the set of remaining vertices contains the root and has a size only depending on 𝜀 but noton the size of the tree.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1002/rsa.70023
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.