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 (9)
- Fast unfolding of communities in large networks
- Modularity and 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
- Phase transition in the detection of modules in sparse networks
- Robustness of community structure in networks
- Learning Latent Block Structure in Weighted Networks
- Detecting communities using asymptotical Surprise