Network clustering and community detection using modulus of families of loops
arXiv:1609.00461 · doi:10.1103/PhysRevE.95.012316
Abstract
We study the structure of loops in networks using the notion of modulus of loop families. We introduce a new measure of network clustering by quantifying the richness of families of (simple) loops. Modulus tries to minimize the expected overlap among loops by spreading the expected link-usage optimally. We propose weighting networks using these expected link-usages to improve classical community detection algorithms. We show that the proposed method enhances the performance of certain algorithms, such as spectral partitioning and modularity maximization heuristics, on standard benchmarks.
8 pages, 20 figures
References in corpus (9)
- Fast unfolding of communities in large networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Comparing community structure identification
- Quantifying social group evolution
- Community Structure in Jazz
- The role of clustering and gridlike ordering in epidemic spreading