Cargando…

A novel perturbation based compression complexity measure for networks

Measuring complexity of brain networks in the form of integrated information is a leading approach towards building a fundamental theory of consciousness. Integrated Information Theory (IIT) has gained attention in this regard due to its theoretically strong framework. Nevertheless, it faces some li...

Descripción completa

Detalles Bibliográficos
Autores principales: Virmani, Mohit, Nagaraj, Nithin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6383034/
https://www.ncbi.nlm.nih.gov/pubmed/30828654
http://dx.doi.org/10.1016/j.heliyon.2019.e01181
_version_ 1783396767436374016
author Virmani, Mohit
Nagaraj, Nithin
author_facet Virmani, Mohit
Nagaraj, Nithin
author_sort Virmani, Mohit
collection PubMed
description Measuring complexity of brain networks in the form of integrated information is a leading approach towards building a fundamental theory of consciousness. Integrated Information Theory (IIT) has gained attention in this regard due to its theoretically strong framework. Nevertheless, it faces some limitations such as current state dependence, computational intractability and inability to be applied to real brain data. On the other hand, Perturbational Complexity Index (PCI) is a clinical measure for distinguishing different levels of consciousness. Though PCI claims to capture the functional differentiation and integration in brain networks (similar to IIT), its link to integrated information is rather weak. Inspired by these two perspectives, we propose a new complexity measure for brain networks – [Formula: see text] using a novel perturbation based compression-complexity approach that serves as a bridge between the two, for the first time. [Formula: see text] is founded on the principles of lossless data compression based complexity measures which is computed by a perturbational approach. [Formula: see text] exhibits following salient innovations: (i) mathematically well bounded, (ii) negligible current state dependence unlike Φ, (iii) network complexity measured as compression-complexity rather than as an infotheoretic quantity, and (iv) lower computational complexity since number of atomic bipartitions scales linearly with the number of nodes of the network, thus avoiding combinatorial explosion. Our computations have revealed that [Formula: see text] has similar hierarchy to <Φ> for several multiple-node networks and it demonstrates a rich interplay between differentiation, integration and entropy of the nodes of a network. [Formula: see text] is a promising heuristic measure to characterize network complexity (and hence might be useful in contributing to building a measure of consciousness) with potential applications in estimating brain complexity on neurophysiological data.
format Online
Article
Text
id pubmed-6383034
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher Elsevier
record_format MEDLINE/PubMed
spelling pubmed-63830342019-03-01 A novel perturbation based compression complexity measure for networks Virmani, Mohit Nagaraj, Nithin Heliyon Article Measuring complexity of brain networks in the form of integrated information is a leading approach towards building a fundamental theory of consciousness. Integrated Information Theory (IIT) has gained attention in this regard due to its theoretically strong framework. Nevertheless, it faces some limitations such as current state dependence, computational intractability and inability to be applied to real brain data. On the other hand, Perturbational Complexity Index (PCI) is a clinical measure for distinguishing different levels of consciousness. Though PCI claims to capture the functional differentiation and integration in brain networks (similar to IIT), its link to integrated information is rather weak. Inspired by these two perspectives, we propose a new complexity measure for brain networks – [Formula: see text] using a novel perturbation based compression-complexity approach that serves as a bridge between the two, for the first time. [Formula: see text] is founded on the principles of lossless data compression based complexity measures which is computed by a perturbational approach. [Formula: see text] exhibits following salient innovations: (i) mathematically well bounded, (ii) negligible current state dependence unlike Φ, (iii) network complexity measured as compression-complexity rather than as an infotheoretic quantity, and (iv) lower computational complexity since number of atomic bipartitions scales linearly with the number of nodes of the network, thus avoiding combinatorial explosion. Our computations have revealed that [Formula: see text] has similar hierarchy to <Φ> for several multiple-node networks and it demonstrates a rich interplay between differentiation, integration and entropy of the nodes of a network. [Formula: see text] is a promising heuristic measure to characterize network complexity (and hence might be useful in contributing to building a measure of consciousness) with potential applications in estimating brain complexity on neurophysiological data. Elsevier 2019-02-18 /pmc/articles/PMC6383034/ /pubmed/30828654 http://dx.doi.org/10.1016/j.heliyon.2019.e01181 Text en © 2019 The Authors http://creativecommons.org/licenses/by-nc-nd/4.0/ This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
spellingShingle Article
Virmani, Mohit
Nagaraj, Nithin
A novel perturbation based compression complexity measure for networks
title A novel perturbation based compression complexity measure for networks
title_full A novel perturbation based compression complexity measure for networks
title_fullStr A novel perturbation based compression complexity measure for networks
title_full_unstemmed A novel perturbation based compression complexity measure for networks
title_short A novel perturbation based compression complexity measure for networks
title_sort novel perturbation based compression complexity measure for networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6383034/
https://www.ncbi.nlm.nih.gov/pubmed/30828654
http://dx.doi.org/10.1016/j.heliyon.2019.e01181
work_keys_str_mv AT virmanimohit anovelperturbationbasedcompressioncomplexitymeasurefornetworks
AT nagarajnithin anovelperturbationbasedcompressioncomplexitymeasurefornetworks
AT virmanimohit novelperturbationbasedcompressioncomplexitymeasurefornetworks
AT nagarajnithin novelperturbationbasedcompressioncomplexitymeasurefornetworks