Bottleneck capacity of random graphs for connectomics

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

With developments in experimental connectomics producing wiring diagrams of many neuronal networks, there is emerging interest in theories to understand the relationship between structure and function. Efficiency of information flow in networks has been proposed as a key functional in characterizing cognition, and we have previously shown that information-theoretic limits on information flow are predictive of behavioral speed in the nematode Caenorhabditis elegans. In particular, we defined and computed a notion called effective bottleneck capacity that emerged from a pipelining model of information flow. It was unclear, however, whether the particular C. elegans connectome had unique capacity properties or whether similar properties would hold for random networks. Here, we determine the effective bottleneck capacity for several random graph ensembles to understand the range of possible variation and compare to the C. elegans network.

Original languageEnglish (US)
Title of host publication2016 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages6305-6309
Number of pages5
ISBN (Electronic)9781479999880
DOIs
StatePublished - May 18 2016
Event41st IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016 - Shanghai, China
Duration: Mar 20 2016Mar 25 2016

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume2016-May
ISSN (Print)1520-6149

Other

Other41st IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2016
CountryChina
CityShanghai
Period3/20/163/25/16

Keywords

  • connectomics
  • graph signal processing
  • information flow
  • random graphs

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Bottleneck capacity of random graphs for connectomics'. Together they form a unique fingerprint.

Cite this