Quantifying neuronal network dynamics through coarse-grained event trees

Research output: Contribution to journalArticle

Abstract

Animals process information about many stimulus features simultaneously, swiftly (in a few 100 ms), and robustly (even when individual neurons do not themselves respond reliably). When the brain carries, codes, and certainly when it decodes information, it must do so through some coarse-grained projection mechanism. How can a projection retain information about network dynamics that covers multiple features, swiftly and robustly? Here, by a coarse-grained projection to event trees and to the event chains that comprise these trees, we propose a method of characterizing dynamic information of neuronal networks by using a statistical collection of spatial-temporal sequences of relevant physiological observables (such as sequences of spiking multiple neurons). We demonstrate, through idealized point neuron simulations in small networks, that this event tree analysis can reveal, with high reliability, information about multiple stimulus features within short realistic observation times. Then, with a large-scale realistic computational model of V1, we show that coarse-grained event trees contain sufficient information, again over short observation times, for fine discrimination of orientation, with results consistent with recent experimental observation.

Original languageEnglish (US)
Pages (from-to)10990-10995
Number of pages6
JournalProceedings of the National Academy of Sciences of the United States of America
Volume105
Issue number31
DOIs
StatePublished - Aug 5 2008

Fingerprint

Information Services
Observation
Neurons
Brain

Keywords

  • Information transmission
  • Neuronal coding
  • Orientation selectivity
  • Primary visual cortex

ASJC Scopus subject areas

  • Genetics
  • General

Cite this

@article{bc887f9cf14640338f036a7dd9b747d4,
title = "Quantifying neuronal network dynamics through coarse-grained event trees",
abstract = "Animals process information about many stimulus features simultaneously, swiftly (in a few 100 ms), and robustly (even when individual neurons do not themselves respond reliably). When the brain carries, codes, and certainly when it decodes information, it must do so through some coarse-grained projection mechanism. How can a projection retain information about network dynamics that covers multiple features, swiftly and robustly? Here, by a coarse-grained projection to event trees and to the event chains that comprise these trees, we propose a method of characterizing dynamic information of neuronal networks by using a statistical collection of spatial-temporal sequences of relevant physiological observables (such as sequences of spiking multiple neurons). We demonstrate, through idealized point neuron simulations in small networks, that this event tree analysis can reveal, with high reliability, information about multiple stimulus features within short realistic observation times. Then, with a large-scale realistic computational model of V1, we show that coarse-grained event trees contain sufficient information, again over short observation times, for fine discrimination of orientation, with results consistent with recent experimental observation.",
keywords = "Information transmission, Neuronal coding, Orientation selectivity, Primary visual cortex",
author = "Rangan, {Aaditya V.} and David Cai and McLaughlin, {David W.}",
year = "2008",
month = "8",
day = "5",
doi = "10.1073/pnas.0804303105",
language = "English (US)",
volume = "105",
pages = "10990--10995",
journal = "Proceedings of the National Academy of Sciences of the United States of America",
issn = "0027-8424",
number = "31",

}

TY - JOUR

T1 - Quantifying neuronal network dynamics through coarse-grained event trees

AU - Rangan, Aaditya V.

AU - Cai, David

AU - McLaughlin, David W.

PY - 2008/8/5

Y1 - 2008/8/5

N2 - Animals process information about many stimulus features simultaneously, swiftly (in a few 100 ms), and robustly (even when individual neurons do not themselves respond reliably). When the brain carries, codes, and certainly when it decodes information, it must do so through some coarse-grained projection mechanism. How can a projection retain information about network dynamics that covers multiple features, swiftly and robustly? Here, by a coarse-grained projection to event trees and to the event chains that comprise these trees, we propose a method of characterizing dynamic information of neuronal networks by using a statistical collection of spatial-temporal sequences of relevant physiological observables (such as sequences of spiking multiple neurons). We demonstrate, through idealized point neuron simulations in small networks, that this event tree analysis can reveal, with high reliability, information about multiple stimulus features within short realistic observation times. Then, with a large-scale realistic computational model of V1, we show that coarse-grained event trees contain sufficient information, again over short observation times, for fine discrimination of orientation, with results consistent with recent experimental observation.

AB - Animals process information about many stimulus features simultaneously, swiftly (in a few 100 ms), and robustly (even when individual neurons do not themselves respond reliably). When the brain carries, codes, and certainly when it decodes information, it must do so through some coarse-grained projection mechanism. How can a projection retain information about network dynamics that covers multiple features, swiftly and robustly? Here, by a coarse-grained projection to event trees and to the event chains that comprise these trees, we propose a method of characterizing dynamic information of neuronal networks by using a statistical collection of spatial-temporal sequences of relevant physiological observables (such as sequences of spiking multiple neurons). We demonstrate, through idealized point neuron simulations in small networks, that this event tree analysis can reveal, with high reliability, information about multiple stimulus features within short realistic observation times. Then, with a large-scale realistic computational model of V1, we show that coarse-grained event trees contain sufficient information, again over short observation times, for fine discrimination of orientation, with results consistent with recent experimental observation.

KW - Information transmission

KW - Neuronal coding

KW - Orientation selectivity

KW - Primary visual cortex

UR - http://www.scopus.com/inward/record.url?scp=49449093612&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49449093612&partnerID=8YFLogxK

U2 - 10.1073/pnas.0804303105

DO - 10.1073/pnas.0804303105

M3 - Article

VL - 105

SP - 10990

EP - 10995

JO - Proceedings of the National Academy of Sciences of the United States of America

JF - Proceedings of the National Academy of Sciences of the United States of America

SN - 0027-8424

IS - 31

ER -