Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
Not on the map. Why?
Abstract (arXiv)
Community detection is one of the most important methodological fields of network science, and one which has attracted a significant amount of attention over the past decades. This area deals with the automated division of a network into fundamental building blocks, with the objective of providing a summary of its large-scale structure. Despite its importance and widespread adoption, there is a noticeable gap between what is arguably the state-of-the-art and the methods that are actually used in practice in a variety of fields. Here we attempt to address this discrepancy by dividing existing methods according to whether they have a "descriptive" or an "inferential" goal. While descriptive methods find patterns in networks based on context-dependent notions of community structure, inferential methods articulate generative models, and attempt to fit them to data. In this way, they are able to provide insights into the mechanisms of network formation, and separate structure from randomness in a manner supported by statistical evidence. We review how employing descriptive methods with inferential aims is riddled with pitfalls and misleading answers, and thus should be in general avoided. We argue that inferential methods are more typically aligned with clearer scientific questions, yield more robust results, and should be in many cases preferred. We attempt to dispel some myths and half-truths often believed when community detection is employed in practice, in an effort to improve both the use of such methods as well as the interpretation of their results.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 39 of its 140 references that are in the map. First posted on arXiv 30 Nov 2021.
Builds on
39 of 140 references.
References · 39
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 379
- 2017Community Detection and Stochastic Block Modelscited by 317
- 2015Statistical physics of inference: Thresholds and algorithmscited by 128
- 2016Community detection in networks: A user guidecited by 105
- 2013Spectral redemption: clustering sparse networkscited by 54
- 2020Bayesian Workflowcited by 47
- 2016The ground truth about metadata and community detection in networkscited by 42
- 2013Hierarchical Block Structures and High-resolution Model Selection in Large Networkscited by 37
- 2019Stacking Models for Nearly Optimal Link Prediction in Complex Networkscited by 35
- 2015Structure and inference in annotated networkscited by 30
- 2013Efficient Monte Carlo and greedy heuristic for the inference of stochastic block modelscited by 29
- 2017Bayesian stochastic blockmodelingcited by 27
27 more
- 2015Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networkscited by 24
- 2016Nonparametric Bayesian inference of the microcanonical stochastic block modelcited by 21
- 2013Network histograms and universality of blockmodel approximationcited by 20
- 2017The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardnesscited by 20
- 2017Network structure from rich but noisy datacited by 17
- 2018Evaluating Overfit and Underfit in Models of Network Community Structurecited by 17
- 2014Scalable detection of statistically significant communities and hierarchies, using message-passing for modularitycited by 16
- 2016Configuring Random Graph Models with Fixed Degree Sequencescited by 15
- 2019Network reconstruction and community detection from dynamicscited by 13
- 2014Identification of core-periphery structure in networkscited by 11
- 2018Reconstructing networks with unknown and heterogeneous errorscited by 11
- 2020Merge-split Markov chain Monte Carlo for community detectioncited by 10
- 2016Estimating the number of communities in a networkcited by 9
- 2016Network structure, metadata and the prediction of missing nodes and annotationscited by 8
- 2016The many facets of community detection in complex networkscited by 8
- 2014Efficiently inferring community structure in bipartite networkscited by 7
- 2015Structural inference for uncertain networkscited by 7
- 2020Revealing consensus and dissensus between network partitionscited by 7
- 2020Statistical inference of assortative community structurescited by 7
- 2017Consistencies and inconsistencies between model selection and link prediction in networkscited by 6
- 2021Disentangling homophily, community structure and triadic closure in networkscited by 6
- 2018Universality of the stochastic block modelcited by 5
- 2018Community detection in networks without observing edgescited by 4
- 2019Consistency of community structure in complex networkscited by 4
- 2021Representative community divisions of networkscited by 4
- 2017Algorithmic detectability threshold of the stochastic block modelcited by 2
- 2014Estimating the resolution limit of the map equation in community detectioncited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1.
3 papers.