General
Vol. 1, Issue 1, 2019February 27, 2019 EDT

On the discovery of the seed in uniform attachment trees

https://doi.org/10.24166/im.02.2019
math.st (mathematics - statistics) cs.dm (computer science - discrete mathematics) cs.si math.pr (mathematics - probability) stat.th (statistics - theory) 05c80
Photo by Keagan Henman on Unsplash

Abstract

Read article at 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.

Read article at ArXiv