Sorry, you need to enable JavaScript to visit this website.

facebooktwittermailshare

Bottleneck Capacity of Random Graphs for Connectomics

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.

Varshney.pdf

PDF icon Varshney.pdf (181 downloads)
up
0 users have voted:

Paper Details

Authors:
Lav R. Varshney
Submitted On:
20 March 2016 - 4:38am
Short Link:
Type:
Presentation Slides
Event:
Presenter's Name:
Lav R. Varshney
Document Year:
2016
Cite

Document Files

Varshney.pdf

(181 downloads)

Subscribe

[1] Lav R. Varshney, "Bottleneck Capacity of Random Graphs for Connectomics", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/859. Accessed: Apr. 30, 2017.
@article{859-16,
url = {http://sigport.org/859},
author = {Lav R. Varshney },
publisher = {IEEE SigPort},
title = {Bottleneck Capacity of Random Graphs for Connectomics},
year = {2016} }
TY - EJOUR
T1 - Bottleneck Capacity of Random Graphs for Connectomics
AU - Lav R. Varshney
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/859
ER -
Lav R. Varshney. (2016). Bottleneck Capacity of Random Graphs for Connectomics. IEEE SigPort. http://sigport.org/859
Lav R. Varshney, 2016. Bottleneck Capacity of Random Graphs for Connectomics. Available at: http://sigport.org/859.
Lav R. Varshney. (2016). "Bottleneck Capacity of Random Graphs for Connectomics." Web.
1. Lav R. Varshney. Bottleneck Capacity of Random Graphs for Connectomics [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/859