Community detection in weighted brain connectivity networks beyond the resolution limit
arXiv:1609.04316
Abstract
Graph theory provides a powerful framework to investigate brain functional connectivity networks and their modular organization. However, most graph-based methods suffer from a fundamental resolution limit that may have affected previous studies and prevented detection of modules, or communities, that are smaller than a specific scale. Surprise, a resolution-limit-free function rooted in discrete probability theory, has been recently introduced and applied to brain networks, revealing a wide size-distribution of functional modules, in contrast with many previous reports. However, the use of Surprise is limited to binary networks, while brain networks are intrinsically weighted, reflecting a continuous distribution of connectivity strengths between different brain regions. Here, we propose Asymptotical Surprise, a continuous version of Surprise, for the study of weighted brain connectivity networks, and validate this approach in synthetic networks endowed with a ground-truth modular structure. We compare Asymptotical Surprise with leading community detection methods currently in use and show its superior sensitivity in the detection of small modules even in the presence of noise and intersubject variability such as those observed in fMRI data. Finally, we apply our novel approach to functional connectivity networks from resting state fMRI experimenta, and demonstrate a heterogeneous modular organization, with a wide distribution of clusters spanning multiple scales.
arXiv comment27 pages with 6 figures and 1 table. Conference version for CCS2016
References in corpus (20)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Modularity and community structure in networks
- Community detection in graphs
- Maps of random walks on complex networks reveal community structure
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Community detection algorithms: a comparative analysis
- Statistical Mechanics of Community Detection
- Hierarchical modularity in human brain functional networks
- Limits of modularity maximization in community detection
- A small-world of weak ties provides optimal global integration of self-similar modules in functional brain networks
- Multiresolution community detection for megascale networks by information-based replica correlations
- Local resolution-limit-free Potts model for community detection
- Deciphering Network Community Structure by Surprise
- Detecting communities using asymptotical Surprise
- Ranking and clustering of nodes in networks with smart teleportation
- Surprise maximization reveals the community structure of complex networks
- Estimating the resolution limit of the map equation in community detection
- Hierarchical organization of functional connectivity in the mouse brain: a complex network approach