Weight Thresholding on Complex Networks
arXiv:1806.07479 · doi:10.1103/PhysRevE.98.042304
Abstract
Weight thresholding is a simple technique that aims at reducing the number of edges in weighted networks that are otherwise too dense for the application of standard graph theoretical methods. We show that the group structure of real weighted networks is very robust under weight thresholding, as it is maintained even when most of the edges are removed. This appears to be related to the correlation between topology and weight that characterizes real networks. On the other hand, the behavior of other properties is generally system dependent.
arXiv commentTo appear in Physical Review E
References in corpus (14)
- Fast unfolding of communities in large networks
- Modularity and community structure in networks
- Community detection in graphs
- Efficient Behavior of Small-World Networks
- The architecture of complex weighted networks
- Benchmark graphs for testing community detection algorithms
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
- A tool for filtering information in complex systems
- Extracting the multiscale backbone of complex weighted networks
- Multi-scale community organization of the human structural connectome and its relationship with resting-state functional connectivity
- Information filtering in complex weighted networks
- Unwinding the hairball graph: pruning algorithms for weighted complex networks
- Eigenvector dynamics under perturbation of modular networks
Cited by in corpus (6)
- Adaptive binarization based on fuzzy integrals
- Predicting complex user behavior from CDR based social networks
- Effective Resistance for Pandemics: Mobility Network Sparsification for High-Fidelity Epidemic Simulation
- Threshold-free estimation of entropy from a Pearson matrix
- Unveiling music genre structure through common-interest communities
- A perturbation-based approach to identifying potentially superfluous network constituents