2 problems

Noise-threshold conjecture. For linear preferential attachment (LPA), corresponding to $\alpha=0$ and $\beta=1$, if $\theta=o(n^{-1/2})$, then

Large-error lower-bound conjecture. The required confidence-set size is at least a constant multiple of $k\ell$ for sufficiently large seeds and a fixed positive error level. This…