On the discovery of the seed in uniform attachment trees

Luc Devroye; Tommy Reddad

On the discovery of the seed in uniform attachment trees

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.00969 v3 pith:VCE5HPVC submitted 2018-10-01 math.ST cs.DMcs.SImath.PRstat.TH

Luc Devroye , Tommy Reddad This is my paper · ORCID

classification math.STcs.DMcs.SImath.PRstat.TH

keywords seedattachmentuniformgivenknowledgeseededtreesconfidence

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Subcritical percolation and network archaeology on random recursive tree substrate networks
math.PR 2026-07 accept novelty 5.0 of 10

For random recursive trees with independent Erdős–Rényi shortcut edges, subcritical bond percolation exposes a decorated tree structure on which Jordan centrality recovers the root within a deterministic-size confidence set.

Pith tools