Show simple item record

dc.contributor.authorDe Vico Fallani, Fen_US
dc.contributor.authorLatora, Ven_US
dc.contributor.authorChavez, Men_US
dc.date.accessioned2017-04-12T09:37:24Z
dc.date.available2016-12-13en_US
dc.date.issued2017-01en_US
dc.date.submitted2017-04-05T11:00:16.651Z
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/22485
dc.description.abstractIn 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.en_US
dc.description.sponsorshipVL and MC acknowledge support by the European Commission Project LASAGNE Grant 318132; VL acknowledges support from EPSRC project GALE Grant EP/K020633/1; FDVF and MC acknowledge support by French program “Investissements d’avenir” ANR-10-IAIHU-06; FDVF acknowledges support by the “Agence Nationale de la Recherche” through contract number ANR-15-NEUC-0006-02. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.en_US
dc.format.extente1005305 - ?en_US
dc.languageengen_US
dc.relation.ispartofPLoS Comput Biolen_US
dc.rightsThis is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
dc.subjectBrainen_US
dc.subjectBrain Mappingen_US
dc.subjectComputational Biologyen_US
dc.subjectComputer Simulationen_US
dc.subjectHumansen_US
dc.subjectModels, Statisticalen_US
dc.subjectNerve Neten_US
dc.titleA Topological Criterion for Filtering Information in Complex Brain Networks.en_US
dc.typeArticle
dc.rights.holder© 2017 De Vico Fallani et al
dc.identifier.doi10.1371/journal.pcbi.1005305en_US
pubs.author-urlhttps://www.ncbi.nlm.nih.gov/pubmed/28076353en_US
pubs.issue1en_US
pubs.notesNot knownen_US
pubs.publication-statusPublished onlineen_US
pubs.volume13en_US
dcterms.dateAccepted2016-12-13en_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record