Statistical test for detecting community structure in real-valued edge-weighted graphs
arXiv:1610.03945 · doi:10.1371/journal.pone.0194079
Abstract
We propose a novel method to test the existence of community structure of undirected real-valued edge-weighted graph. The method is based on Wigner semicircular law on the asymptotic behavior of the random distribution for eigenvalues of a real symmetric matrix. We provide a theoretical foundation for this method and report on its performance in synthetic and real data, suggesting that our method outperforms other state-of-the-art methods.
References in corpus (23)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Fast algorithm for detecting community structure in networks
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Statistical Mechanics of Community Detection
- Modularity from Fluctuations in Random Graphs and Complex Networks
- On Orthogonal and Symplectic Matrix Ensembles
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Spectral redemption: clustering sparse networks
- Mapping change in large networks
- Phase transition in the detection of modules in sparse networks
- Robustness of community structure in networks
- Learning Latent Block Structure in Weighted Networks
- Assessing the relevance of node features for network structure
- Significant Scales in Community Structure
- Stochastic Block Models and Reconstruction
- Finding instabilities in the community structure of complex networks
- Statistical significance of communities in networks
- Detecting communities using asymptotical Surprise