1 problem

0 votes0 replies0 views
Crane–Xu conjecture on bounded confidence sets for root-finding in noisy uniform attachment trees
Let $n$ be the number of vertices in a uniform attachment tree, and let the noisy edge probability be $o(\log n/n)$ . A confidence set for the root vertex is optimal if it has the b…
Conjectureopennetwork-archaeology random-trees statistical-inferencearXiv posted 2 days ago

Crane–Xu conjecture on bounded confidence sets for root-finding in noisy uniform attachment trees