Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
arXiv:2112.00183 · doi:10.1017/9781009118897
Abstract
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.
57 pages, 18 figures
References in corpus (32)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- Maps of random walks on complex networks reveal community structure
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Hierarchical structure and the prediction of missing links in networks
- Statistical Mechanics of Community Detection
- Stochastic blockmodels and community structure in networks
- Community detection in networks: A user guide
- Consensus clustering in complex networks
- An information-theoretic framework for resolving community structure in complex networks
- Missing and spurious interactions and the reconstruction of complex networks
- Modularity and community detection in bipartite networks
- Community detection in networks with positive and negative links
- Analysis of the structure of complex networks at different resolution levels
- Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
- Phase transition in the detection of modules in sparse networks
- A Bayesian Approach to Network Modularity
- Modularity clustering is force-directed layout
- Parsimonious module inference in large networks
- Community Detection as an Inference Problem
- Identification of core-periphery structure in networks
- Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
- The many facets of community detection in complex networks
- When are networks truly modular?
- Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
- Multilayer Network Science: from Cells to Societies
- Disentangling homophily, community structure and triadic closure in networks
- Reconstructing networks
- Thermodynamics of Community Structure
- Representative community divisions of networks
- Gillespie algorithms for stochastic multiagent dynamics in populations and network
Cited by in corpus (9)
- Local dominance unveils clusters in networks
- Descriptive vs. inferential community detection in networks: pitfalls, myths, and half-truths
- Extreme rainfall propagation within Boreal Summer Intraseasonal Oscillation modulated by Pacific sea surface temperature
- Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar
- Random graphs and real networks with weak geometric coupling
- Quantifying the role of supernatural entities and the effect of missing data in Irish sagas
- P-TimeSync: A Precise Time Synchronization Simulation with Network Propagation Delays
- Kaleidoscopic reorganization of network communities across different scales
- Block-corrected Modularity for Community Detection