The University of Southampton
University of Southampton Institutional Repository

Neural complexity and structural connectivity

Neural complexity and structural connectivity
Neural complexity and structural connectivity
Tononi et al. Proc. Natl. Acad. Sci. U.S.A. 91, 5033 1994 proposed a measure of neural complexity based on mutual information between complementary subsystems of a given neural network, which has attracted much interest in the neuroscience community and beyond.We develop an approximation of the measure for a popular Gaussian model which, applied to a continuous-time process, elucidates the relationship between the complexity of a neural system and its structural connectivity. Moreover, the approximation is accurate for weakly coupled systems and computationally cheap, scaling polynomially with system size in contrast to the full complexity measure, which scales exponentially. We also discuss connectivity normalization and resolve some issues stemming from an ambiguity in the original Gaussian model.
1539-3755
051914-[12pp]
Barnett, Lionel
df5b0411-ee06-4f89-b8c8-a120d8644aef
Buckley, Christopher L.
2ad576e4-56b8-4f31-84e0-51bd0b7a1cd3
Barnett, Lionel
df5b0411-ee06-4f89-b8c8-a120d8644aef
Buckley, Christopher L.
2ad576e4-56b8-4f31-84e0-51bd0b7a1cd3

Barnett, Lionel and Buckley, Christopher L. (2009) Neural complexity and structural connectivity. Physical Review E, 79 (5), 051914-[12pp]. (doi:10.1103/PhysRevE.79.051914).

Record type: Article

Abstract

Tononi et al. Proc. Natl. Acad. Sci. U.S.A. 91, 5033 1994 proposed a measure of neural complexity based on mutual information between complementary subsystems of a given neural network, which has attracted much interest in the neuroscience community and beyond.We develop an approximation of the measure for a popular Gaussian model which, applied to a continuous-time process, elucidates the relationship between the complexity of a neural system and its structural connectivity. Moreover, the approximation is accurate for weakly coupled systems and computationally cheap, scaling polynomially with system size in contrast to the full complexity measure, which scales exponentially. We also discuss connectivity normalization and resolve some issues stemming from an ambiguity in the original Gaussian model.

Text
PhysRevE-2.pdf - Version of Record
Download (1MB)

More information

Published date: 19 May 2009
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 267384
URI: http://eprints.soton.ac.uk/id/eprint/267384
ISSN: 1539-3755
PURE UUID: f3355364-a632-48fc-8b66-56d5fa6324fd

Catalogue record

Date deposited: 20 May 2009 15:30
Last modified: 14 Mar 2024 08:48

Export record

Altmetrics

Contributors

Author: Lionel Barnett

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×