Show simple item record

dc.contributor.authorAddario‐Berry, Louigi
dc.contributor.authorBrandenberger, Anna
dc.contributor.authorBriend, Simon
dc.contributor.authorBroutin, Nicolas
dc.contributor.authorLugosi, Gábor
dc.date.accessioned2025-10-29T16:54:01Z
dc.date.available2025-10-29T16:54:01Z
dc.date.issued2025-08-04
dc.identifier.issn1042-9832
dc.identifier.issn1098-2418
dc.identifier.urihttps://hdl.handle.net/1721.1/163405
dc.description.abstractIn 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.en_US
dc.publisherWileyen_US
dc.relation.isversionofhttps://doi.org/10.1002/rsa.70023en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceWileyen_US
dc.titleLeaf Stripping on Uniform Attachment Treesen_US
dc.typeArticleen_US
dc.identifier.citationAddario-Berry, L., Brandenberger, A., Briend, S., Broutin, N. and Lugosi, G. (2025), Leaf Stripping on Uniform Attachment Trees. Random Struct Alg, 67: e70023.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.relation.journalRandom Structures & Algorithmsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.identifier.doihttps://doi.org/10.1002/rsa.70023
dspace.date.submission2025-10-29T16:45:46Z
mit.journal.volume67en_US
mit.journal.issue1en_US
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record