4 problems

Conjecture on early-vertex statistics beyond centrality in correlated uniform attachment trees
arXiv@arxiv
Early-vertex statistic conjecture. Replacing the tree-specific notion of centrality with another statistic that identifies early vertices, and studying analogous subsequent local s…
Conjectureopennetwork-statistics random-trees uniform-attachment
1
Conjecture on the limiting proportion of central vertices in correlated uniform attachment trees
arXiv@arxiv
Central-vertex proportion conjecture. As $K\to\infty$ , this proportion converges to
Conjectureopencentrality random-trees uniform-attachment
1
Tight noise thresholds for root confidence sets in preferential and uniform attachment
arXiv@arxiv
Noise-threshold conjecture. For linear preferential attachment (LPA), corresponding to $\alpha=0$ and $\beta=1$ , if $\theta=o(n^{-1/2})$ , then
Conjectureopennetwork-inference preferential-attachment uniform-attachment
0
The large-error lower-bound conjecture for uniform attachment seed detection
arXiv@arxiv
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…
Conjectureopenrandom-trees seed-detection uniform-attachment
1

Conjecture on early-vertex statistics beyond centrality in correlated uniform attachment trees