Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves

Steven N. Evans, Daniel Lanoue

Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformly at random without replacement and let $W_k$, $2\le k\le n$, be the length of the subtree spanned by t…