2000 character limit reached
On the discovery of the seed in uniform attachment trees (1810.00969v3)
Published 1 Oct 2018 in math.ST, cs.DM, cs.SI, math.PR, and stat.TH
Abstract: 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.