Metraipolis › archive › dc_f2b558d698b1

A Threshold Constant for Exact Community Recovery in the Degree-Corrected Poisson Stochastic Block Model — arXiv:2609.15793

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15793
License (as archived)
CC0-1.0
Archived
2026-10-16T01:13:54.617Z
SHA-256 of the archived text
dcb8a618419ac70c65a47391f41c71239076c3bfa22ba2f3ddda9ca1b871dd42
Stable URL of this page
https://metraipolis.com/documento/dc_f2b558d698b1

How to cite

A Threshold Constant for Exact Community Recovery in the Degree-Corrected Poisson Stochastic Block Model — arXiv:2609.15793 — arXiv (en), https://arxiv.org/abs/2609.15793 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f2b558d698b1 (Metraipolis archive dc_f2b558d698b1, sha256 dcb8a618419ac70c65a47391f41c71239076c3bfa22ba2f3ddda9ca1b871dd42)
BibTeX
@misc{dcf2b558d698b1,
  title = {A Threshold Constant for Exact Community Recovery in the Degree-Corrected Poisson Stochastic Block Model — arXiv:2609.15793},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15793},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f2b558d698b1; sha256 dcb8a618419ac70c65a47391f41c71239076c3bfa22ba2f3ddda9ca1b871dd42},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15793. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study exact community recovery in the Degree-Corrected Poisson Stochastic Block Model (DC-SBM) through the maximum profile likelihood estimator. Our main contribution is identifying an explicit complexity constant $C(\pi,S)$, which closely captures the exact recovery threshold. This constant combines a weighted Chernoff--Hellinger separation between communities with a Kullback--Leibler correction induced by the degree-normalized block volumes. We rigorously prove that $C(\pi,S)>1$ ensures the strong consistency of the maximum profile likelihood estimator, yielding exact community recovery down to the logarithmic sparsity scale. We conjecture that $C(\pi,S)=1$ represents the sharp information-theoretic threshold, providing an upper bound on the exact-recovery transition, and we discuss analogies with the binary SBM and binary DC-SBM cases. Additionally, we establish weak consistency when the average degree diverges, offering a unified picture across sparse and dense regimes. The proofs require new control of the profile likelihood in the presence of heterogeneous degree parameters, whose node-specific weights fundamentally alter the geometry and concentration of the recovery problem.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.ST).
Categorie arXiv: Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.15793 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:31:08.672Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).