MathDB4 problems
- 0 votes0 replies0 views
Minimal sparsity condition for asymptotic normality of the studentized network U-statistic
Minimal sparsity conjecture. The condition
- 0 votes0 replies1 view
Conjecture on early-vertex statistics beyond centrality in correlated uniform attachment trees
Early-vertex statistic conjecture. Replacing the tree-specific notion of centrality with another statistic that identifies early vertices, and studying analogous subsequent local s…
- 0 votes0 replies0 views
Conjecture that rooted densities are sufficient statistics for finite-rank kernels
A kernel is a graphon kernel whose rank is finite, and its rooted densities are the subgraph densities rooted at specified vertices. Rooted-density sufficiency conjecture. Rooted d…
- 0 votes0 replies0 views
Conjecture on avoiding ERGM degeneracy with complete constraint sets
An exponential random graph model (ERGM) is fitted using a complete set of constraints up to order , meaning that all subgraph-count constraints through that order are included…