A generalised significance test for individual communities in networks
arXiv:1712.00298 · doi:10.1038/s41598-018-25560-z
Abstract
Many empirical networks have community structure, in which nodes are densely interconnected within each community (i.e., a group of nodes) and sparsely across different communities. Like other local and meso-scale structure of networks, communities are generally heterogeneous in various aspects such as the size, density of edges, connectivity to other communities and significance. In the present study, we propose a method to statistically test the significance of individual communities in a given network. Compared to the previous methods, the present algorithm is unique in that it accepts different community-detection algorithms and the corresponding quality function for single communities. The present method requires that a quality of each community can be quantified and that community detection is performed as optimisation of such a quality function summed over the communities. Various community detection algorithms including modularity maximisation and graph partitioning meet this criterion. Our method estimates a distribution of the quality function for randomised networks to calculate a likelihood of each community in the given network. We illustrate our algorithm by synthetic and empirical networks.
20 pages, 4 figures and 4 tables
References in corpus (13)
- Fast unfolding of communities in large networks
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Stochastic blockmodels and community structure in networks
- Community detection in networks: A user guide
- Finding statistically significant communities in networks
- Community Structure in Jazz
- Mixture models and exploratory analysis in networks
- Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
- Robustness of community structure in networks
- Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
- Core-periphery structure requires something else in the network