dorsal/arxiv
View SchemaMatrix Factorization Framework for Community Detection under the Degree-Corrected Block Model
| Authors | Alexandra Dache, Arnaud Vandaele, Nicolas Gillis |
|---|---|
| Categories | |
| ArXiv ID | 2601.06262vv1 |
| URL | https://arxiv.org/abs/2601.06262 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Community detection is a fundamental task in data analysis. Block models form a standard approach to partition nodes according to a graph model, facilitating the analysis and interpretation of the network structure. By grouping nodes with similar connection patterns, they enable the identification of a wide variety of underlying structures. The degree-corrected block model (DCBM) is an established model that accounts for the heterogeneity of node degrees. However, existing inference methods for the DCBM are heuristics that are highly sensitive to initialization, typically done randomly. In this work, we show that DCBM inference can be reformulated as a constrained nonnegative matrix factorization problem. Leveraging this insight, we propose a novel method for community detection and a theoretically well-grounded initialization strategy that provides an initial estimate of communities for inference algorithms. Our approach is agnostic to any specific network structure and applies to graphs with any structure representable by a DCBM, not only assortative ones. Experiments on synthetic and real benchmark networks show that our method detects communities comparable to those found by DCBM inference, while scaling linearly with the number of edges and communities; for instance, it processes a graph with 100,000 nodes and 2,000,000 edges in approximately 4 minutes. Moreover, the proposed initialization strategy significantly improves solution quality and reduces the number of iterations required by all tested inference algorithms. Overall, this work provides a scalable and robust framework for community detection and highlights the benefits of a matrix-factorization perspective for the DCBM.
{
"annotation_id": "6b125758-fbc8-41ea-aab5-08e36f3c83f2",
"date_created": "2026-02-17T05:53:07.518000Z",
"date_modified": "2026-02-17T05:53:07.518000Z",
"file_hash": "aa8707137e75a396234863233978801e9dd6f353b21d884104d48736791a33f5",
"private": false,
"record": {
"abstract": "Community detection is a fundamental task in data analysis. Block models form a standard approach to partition nodes according to a graph model, facilitating the analysis and interpretation of the network structure. By grouping nodes with similar connection patterns, they enable the identification of a wide variety of underlying structures. The degree-corrected block model (DCBM) is an established model that accounts for the heterogeneity of node degrees. However, existing inference methods for the DCBM are heuristics that are highly sensitive to initialization, typically done randomly. In this work, we show that DCBM inference can be reformulated as a constrained nonnegative matrix factorization problem. Leveraging this insight, we propose a novel method for community detection and a theoretically well-grounded initialization strategy that provides an initial estimate of communities for inference algorithms. Our approach is agnostic to any specific network structure and applies to graphs with any structure representable by a DCBM, not only assortative ones. Experiments on synthetic and real benchmark networks show that our method detects communities comparable to those found by DCBM inference, while scaling linearly with the number of edges and communities; for instance, it processes a graph with 100,000 nodes and 2,000,000 edges in approximately 4 minutes. Moreover, the proposed initialization strategy significantly improves solution quality and reduces the number of iterations required by all tested inference algorithms. Overall, this work provides a scalable and robust framework for community detection and highlights the benefits of a matrix-factorization perspective for the DCBM.",
"arxiv_id": "2601.06262",
"authors": [
"Alexandra Dache",
"Arnaud Vandaele",
"Nicolas Gillis"
],
"categories": [
"cs.SI",
"math.OC",
"stat.ML"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model",
"url": "https://arxiv.org/abs/2601.06262",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "06d03bef-37e4-4235-8b89-6e28c55d4195",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}