Cross-validation of correlation networks using modular structure
arXiv:2303.01835 · doi:10.1007/s41109-022-00516-5
Abstract
Correlation networks derived from multivariate data appear in many applications across the sciences. These networks are usually dense and require sparsification to detect meaningful structure. However, current methods for sparsifying correlation networks struggle with balancing overfitting and underfitting. We propose a module-based cross-validation procedure to threshold these networks, making modular structure an integral part of the thresholding. We illustrate our approach using synthetic and real data and find that its ability to recover a planted partition has a step-like dependence on the number of data samples. The reward for sampling more varies non-linearly with the number of samples, with minimal gains after a critical point. A comparison with the well-established WGCNA method shows that our approach allows for revealing more modular structure in the data used here.
References in corpus (5)
- Maps of random walks on complex networks reveal community structure
- A tool for filtering information in complex systems
- Extracting the multiscale backbone of complex weighted networks
- Phase transition in the detection of modules in sparse networks
- Mapping higher-order network flows in memory and multilayer networks with Infomap