2026-04-17T03:17:23Zhttps://recercat.cat/oai/requestoai:recercat.cat:10230/448442025-12-19T23:00:32Zcom_2072_6col_2072_452952
RECERCAT
author
Lugosi, Gábor
author
Pereira, Alan S.
2020-05-28T08:42:46Z2020-05-28T08:42:46Z2019
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.Gábor Lugosi was supported by the Spanish Ministry of Economy and Competitiveness, Grant MTM2015-67304-P and FEDER, EU.
Copyright for all articles in EJP is CC BY 4.0. https://creativecommons.org/licenses/by/4.0/ info:eu-repo/semantics/openAccess
Random trees
Uniform attachment
Discrete probability
Seed
Finding the seed of uniform attachment trees
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion