A Topological Criterion for Filtering Information in Complex Brain Networks
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
In many biological systems, the network of interactions between the elements can only be inferred from experimental measurements. In neuroscience, non-invasive imaging tools are extensively used to derive either structural or functional brain networks in-vivo. As a result of the inference process, we obtain a matrix of values corresponding to a fully connected and weighted network. To turn this into a useful sparse network, thresholding is typically adopted to cancel a percentage of the weakest connections. The structural properties of the resulting network depend on how much of the inferred connectivity is eventually retained. However, how to objectively fix this threshold is still an open issue. We introduce a criterion, the efficiency cost optimization (ECO), to select a threshold based on the optimization of the trade-off between the efficiency of a network and its wiring cost. We prove analytically and we confirm through numerical simulations that the connection density maximizing this trade-off emphasizes the intrinsic properties of a given network, while preserving its sparsity. Moreover, this density threshold can be determined a-priori, since the number of connections to filter only depends on the network size according to a power-law. We validate this result on several brain networks, from micro- to macro-scales, obtained with different imaging modalities. Finally, we test the potential of ECO in discriminating brain states with respect to alternative filtering methods. ECO advances our ability to analyze and compare biological networks, inferred from experimental data, in a fast and principled way.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Complex network measures of brain connectivity: Uses and interpretations
Rubinov, M., & Sporns, O. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.10.003 · Cited by 11,522
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Self-citationEfficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Self-citationThe economy of brain network organization
Bullmore, E., & Sporns, O. (2012) · Nature Reviews Neuroscience · doi:10.1038/nrn3214 · Cited by 3,284
Bassett, D. S., & Bullmore, E. (2006) · The Neuroscientist · doi:10.1177/1073858406293182 · Cited by 2,600 · cited 1×
“Global-and local-efficiency have revealed to be important graph quantities to characterize the structure of complex systems in terms of integration and segregation of information [22, 23].”
BackgroundAchard, S., Salvador, R., Whitcher, B., Suckling, J., & Bullmore, E. (2006) · The Journal of Neuroscience · doi:10.1523/jneurosci.3874-05.2006 · Cited by 2,393
Structural and Functional Brain Networks: From Connections to Cognition
Park, H.-J., & Friston, K. (2013) · Science · doi:10.1126/science.1238411 · Cited by 2,106 · cited 1×
“nalysis.26 To characterize the entire brain network (i.e., large-scale topology), we used global- and local-efficiency, which respectively read: E g = 2 n(n 1) n å i6=j 1 d ij E l = 1 n n å i=1 E g(i) (2) where d ij is the length of the shortest path between nodes i and j, and E g(i) is the global-efficiency of the ith…”
MethodDynamic reconfiguration of human brain networks during learning
Bassett, D. S., Wymbs, N. F., Porter, M. A., Mucha, P. J., Carlson, J. M., & Grafton, S. T. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1018985108 · Cited by 1,705
Tononi, G., Sporns, O., & Edelman, G. M. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.11.5033 · Cited by 1,626
Comparing Brain Networks of Different Size and Connectivity Density Using Graph Theory
van Wijk, B. C. M., Stam, C. J., & Daffertshofer, A. (2010) · PLoS ONE · doi:10.1371/journal.pone.0013701 · Cited by 1,161
Ideker, T., & Sharan, R. (2008) · Genome Research · doi:10.1101/gr.071852.107 · Cited by 817
Time-resolved resting-state brain networks
Zalesky, A., Fornito, A., Cocchi, L., Gollo, L. L., & Breakspear, M. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1400181111 · Cited by 753
Graph analysis of the human connectome: Promise, progress, and pitfalls
Fornito, A., Zalesky, A., & Breakspear, M. (2013) · NeuroImage · doi:10.1016/j.neuroimage.2013.04.087 · Cited by 743
Deterministic and probabilistic tractography based on complex fibre orientation distributions
Descoteaux, M., Deriche, R., Knosche, T. R., & Anwander, A. (2009) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2008.2004424 · Cited by 698
Imaging human connectomes at the macroscale
Craddock, R. C., Jbabdi, S., Yan, C.-G., Vogelstein, J. T., Castellanos, F. X., Di Martino, A., Kelly, C., Heberlein, K., Colcombe, S., & Milham, M. P. (2013) · Nature Methods · doi:10.1038/nmeth.2482 · Cited by 419 · cited 1×
“pology), we measured the centrality of the nodes in the brain network by means of the node degree and of the node betwenness, which respectively read: k i = n å j6=i A ij b i = å j6=i6=h s jh(i) s jh (4) where the element of the adjacency matrix A ij =1 if there is a link between node i and j, zero otherwise; and wher…”
MethodConsistency-based thresholding of the human connectome
Roberts, J. A., Perry, A., Roberts, G., Mitchell, P. B., & Breakspear, M. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2016.09.053 · Cited by 189
Cited by
Developmental effects of oxytocin neurons on social affiliation and processing of social information
Nunes, A. R., Gliksberg, M., Varela, S. A. M., Teles, M., Wircer, E., Blechman, J., Petri, G., Levkowitz, G., & Oliveira, R. F. (2021) · The Journal of Neuroscience · doi:10.1523/jneurosci.2939-20.2021 · Cited by 47
Aydın, S., & Onbaşı, L. (2024) · Cognitive Neurodynamics · doi:10.1007/s11571-023-09931-5 · Cited by 46
Saba, V., Premi, E., Cristillo, V., Gazzina, S., Palluzzi, F., Zanetti, O., Gasparotti, R., Padovani, A., Borroni, B., & Grassi, M. (2019) · Frontiers in Neuroscience · doi:10.3389/fnins.2019.00211 · Cited by 33
Metadata
- Authors
- De Vico Fallani, F., Latora, V., & Chavez, M.
- Venue
- PLOS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2017-01-11
- Volume
- 13
- Issue
- 1
- Pages
- e1005305
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2567503720
- Cited by
- 114
- References
- 17
- FWCI
- 6.59
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.