Translator Disclaimer
2019 Finding the seed of uniform attachment trees
Gábor Lugosi, Alan S. Pereira
Electron. J. Probab. 24: 1-15 (2019). DOI: 10.1214/19-EJP268

Abstract

A uniform attachment tree is a random tree that is generated dynamically. Starting from a fixed “seed” tree, vertices are added sequentially by attaching each vertex to an existing vertex chosen uniformly at random. Upon observing a large (unlabeled) tree, one wishes to find the initial seed. We investigate to what extent seed trees can be recovered, at least partially. We consider three types of seeds: a path, a star, and a random uniform attachment tree. We propose and analyze seed-finding algorithms for all three types of seed trees.

Citation

Download Citation

Gábor Lugosi. Alan S. Pereira. "Finding the seed of uniform attachment trees." Electron. J. Probab. 24 1 - 15, 2019. https://doi.org/10.1214/19-EJP268

Information

Received: 5 January 2018; Accepted: 22 January 2019; Published: 2019
First available in Project Euclid: 28 February 2019

zbMATH: 07055656
MathSciNet: MR3925458
Digital Object Identifier: 10.1214/19-EJP268

Subjects:
Primary: NA

JOURNAL ARTICLE
15 PAGES


SHARE
Vol.24 • 2019
Back to Top