Leaf Stripping on Uniform Attachment Trees
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912064977502208 |
|---|---|
| author | Addario-Berry, Louigi Brandenberger, Anna Briend, Simon Broutin, Nicolas Lugosi, Gábor |
| author_facet | Addario-Berry, Louigi Brandenberger, Anna Briend, Simon Broutin, Nicolas Lugosi, Gábor |
| contents | 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 not on the size of the tree. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_06481 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Leaf Stripping on Uniform Attachment Trees Addario-Berry, Louigi Brandenberger, Anna Briend, Simon Broutin, Nicolas Lugosi, Gábor Probability Data Structures and Algorithms Machine Learning 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 not on the size of the tree. |
| title | Leaf Stripping on Uniform Attachment Trees |
| topic | Probability Data Structures and Algorithms Machine Learning |
| url | https://arxiv.org/abs/2410.06481 |