# On the discovery of the seed in uniform attachment trees

arXiv: https://arxiv.org/abs/1810.00969 · HTML: https://mlsanity.com/paper/1810.00969/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Oct 2018.

## Built on by (most cited first, 3 of 3)

- [Archaeology of random recursive dags and Cooper-Frieze random networks](https://mlsanity.com/paper/2207.14601/) (2022)
- [Estimating the history of a random recursive tree](https://mlsanity.com/paper/2403.09755/) (2024)
- [Leaf Stripping on Uniform Attachment Trees](https://mlsanity.com/paper/2410.06481/) (2024)

## Abstract (arXiv)

We investigate the size of vertex confidence sets for including part of (or the entirety of) the seed in seeded uniform attachment trees, given knowledge of some of the seed's properties, and with a prescribed probability of failure. We also study the problem of identifying the leaves of a seed in a seeded uniform attachment tree, given knowledge of the positions of all internal nodes of the seed.