Abstract
Neuroimaging data can be represented as networks of nodes and edges that capture the topological organization of the brain connectivity. Graph theory provides a general and powerful framework to study these networks and their structure at various scales. By way of example, community detection methods have been widely applied to investigate the modular structure of many natural networks, including brain functional connectivity networks. Sparsification procedures are often applied to remove the weakest edges, which are the most affected by experimental noise, and to reduce the density of the graph, thus making it theoretically and computationally more tractable. However, weak links may also contain significant structural information, and procedures to identify the optimal tradeoff are the subject of active research. Here, we explore the use of percolation analysis, a method grounded in statistical physics, to identify the optimal sparsification threshold for community detection in brain connectivity networks. By using synthetic networks endowed with a ground-truth modular structure and realistic topological features typical of human brain functional connectivity networks, we show that percolation analysis can be applied to identify the optimal sparsification threshold that maximizes information on the networks' community structure. We validate this approach using three different community detection methods widely applied to the analysis of brain connectivity networks: Newman's modularity, InfoMap and Asymptotical Surprise. Importantly, we test the effects of noise and data variability, which are critical factors to determine the optimal threshold. This data-driven method should prove particularly useful in the analysis of the community structure of brain networks in populations characterized by different connectivity strengths, such as patients and controls.
Highlights
In recent years, considerable efforts have been made to study the complex structure of brain connectivity, marking the inception of the “connectomic era” in brain neuroscience
Functional Magnetic Resonance Imaging and other neuroimaging methods have shown that spontaneous fluctuation in brain activity, as measured with a subject lying in the scanner without being engaged in any specific task, are organized in coherent patterns, suggesting that resting state functional connectivity reflects the functional architecture of the brain (Damoiseaux et al, 2006)
We compare the retrieved and planted modular structures by using Normalized Mutual Information, an information theoretic measure of similarity, as a function of sparsification threshold. We find that this information can be maximized by an appropriate choice of threshold, and we assess the use of percolation analysis as a data-driven method for optimal sparsification
Summary
Considerable efforts have been made to study the complex structure of brain connectivity, marking the inception of the “connectomic era” in brain neuroscience. Several methods have been developed and applied to study these patterns of synchronization, including multivariate approaches (e.g., Principal Component or Independent Component Analysis) (Beckmann et al, 2005; Damoiseaux et al, 2006) and graph theoretical methods (Bullmore and Sporns, 2009). A number of graph theoretical studies have revealed a smallworld, rich-club structure (van den Heuvel and Sporns, 2011) of functional connectivity networks, and the presence of hub regions defined by high connectivity and network centrality. Community detection methods have been widely applied to investigate the modular structure of many natural networks, including brain functional connectivity networks. The presence modules, i.e., clusters of nodes that are more densely connected among them than with the rest of the network, reflects functional segregation within the integrated network, and is thought to confer robustness and adaptability to brain connectivity networks (Bullmore and Sporns, 2009)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.