A cycle-counting-ratio estimator for the β-model achieves minimax-optimal MSE and consistency under the weak conditions θ_max→0 and θ_t‖θ‖₁→∞, even at network densities near log n/n.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Benders decomposition with combinatorial feasibility cuts, multiple-cut addition, clique-cover heuristic, and initial cut generation solves k-defensive domination instances on Erdos-Renyi, chordal, and Barabasi-Albert graphs that remain unsolved by classical formulations.
citing papers explorer
-
Subgraph counting estimation for the $\beta$-model in sparse networks
A cycle-counting-ratio estimator for the β-model achieves minimax-optimal MSE and consistency under the weak conditions θ_max→0 and θ_t‖θ‖₁→∞, even at network densities near log n/n.
-
A Benders Decomposition Approach for the k-Defensive Domination Problem
Benders decomposition with combinatorial feasibility cuts, multiple-cut addition, clique-cover heuristic, and initial cut generation solves k-defensive domination instances on Erdos-Renyi, chordal, and Barabasi-Albert graphs that remain unsolved by classical formulations.