1 problem

Tight noise thresholds for root confidence sets in preferential and uniform attachment
Noise-threshold conjecture. For linear preferential attachment (LPA), corresponding to $\alpha=0$ and $\beta=1$ , if $\theta=o(n^{-1/2})$ , then
opennetwork-inference preferential-attachment uniform-attachment
0 responses
06

Tight noise thresholds for root confidence sets in preferential and uniform attachment