Minority communities in stochastic block models enter three phases of detectability—detectable, distinguishable, and resolvable—separated by the Kesten-Stigum threshold and two additional thresholds from the eigenvalue structure of the signal matrix.
Fortunato, Community detection in graphs, Physics reports486, 75 (2010)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.SI 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
DCBM community detection is reformulated as constrained nonnegative matrix factorization, producing a scalable method with strong initialization that matches inference quality on large graphs.
citing papers explorer
-
Detectability of minority communities in networks
Minority communities in stochastic block models enter three phases of detectability—detectable, distinguishable, and resolvable—separated by the Kesten-Stigum threshold and two additional thresholds from the eigenvalue structure of the signal matrix.
-
Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model
DCBM community detection is reformulated as constrained nonnegative matrix factorization, producing a scalable method with strong initialization that matches inference quality on large graphs.