2 problems

Steel's conjecture. In the Ising model, in the Kesten–Stigum regime, high-probability tree model estimation may be achieved with $k=O(\log n)$ samples.

In the binary symmetric latent tree model, let $m$ be the number of observed leaves and let $\tau_{uv}$ denote the edge parameter for each edge $uv$. Assume that, for some constant…