Leaf stripping on uniform attachment trees
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 ro...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2025 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10230/72043 |
| Acceso en línea: | http://hdl.handle.net/10230/72043 http://dx.doi.org/10.1002/rsa.70023 |
| Access Level: | acceso abierto |
| Palabra clave: | Pólya urns Random recursive trees Random trees Root-finding algorithms Root reconstruction Uniform attachment |
| Sumario: | 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. |
|---|