Analysis of community structure in networks of correlated data
arXiv:0812.3030 · doi:10.1103/PhysRevE.80.016114
Abstract
We present a reformulation of modularity that allows the analysis of the community structure in networks of correlated data. The new modularity preserves the probabilistic semantics of the original definition even when the network is directed, weighted, signed, and has self-loops. This is the most general condition one can find in the study of any network, in particular those defined from correlated data. We apply our results to a real network of correlated data between stores in the city of Lyon (France).
5 pages, 2 figures
References in corpus (12)
- Modularity and community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Resolution limit in community detection
- Comparing community structure identification
- Statistical Mechanics of Community Detection
- Community structure in directed networks
- Analysis of the structure of complex networks at different resolution levels
- Size reduction of complex networks preserving modularity
- Limited resolution in complex network community detection with Potts model approach
- A network-based prediction of retail stores commercial categories and optimal locations
- Spectral and network methods in the analysis of correlation matrices of stock returns
- Spectral methods and cluster structure in correlation-based networks