An algorithm for network community structure determination by surprise
arXiv:2012.13780 · doi:10.1016/j.physa.2022.127063
Abstract
Graphs representing real world systems may be studied from their underlying community structure. A community in a network is an intuitive idea for which there is no consensus on its objective mathematical definition. The most used metric in order to detect communities is the modularity, though many disadvantages of this parameter have already been noticed in the literature. In this work, we present a new approach based on a different metric: the surprise. Moreover, the biases of different community detection algorithms and benchmark networks are thoroughly studied, identified and commented about.
29 pages, 6 figures, 7 tables
References in corpus (10)
- 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
- Statistical Mechanics of Community Detection
- Narrow scope for resolution-limit-free community detection
- Surprise maximization reveals the community structure of complex networks
- Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering
- Closed benchmarks for network community structure characterization