A spectrum of routing strategies for brain networks

Andrea Avena-Koenigsberger, Xiaoran Yan, Artemy Kolchinsky, Martijn P. van den Heuvel, Patric Hagmann, Olaf Sporns

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally "cheap" but inefficient. We introduce a stochastic model for network communication that combines local and global information about the network topology to generate biased random walks on the network. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communication processes at the limiting extremes. We implement the model on two cohorts of human connectome networks and investigate the effects of varying the global information bias on the network's communication cost. We identify routing strategies that approach a (highly efficient) shortest-path communication process with a relatively small global information bias on the system's dynamics. Moreover, we show that the cost of routing messages from and to hub nodes varies as a function of the global information bias driving the system's dynamics. Finally, we implement the model to identify individual subject differences from a communication dynamics point of view. The present framework departs from the classical shortest paths vs. diffusion dichotomy, unifying both models under a single family of dynamical processes that differ by the extent to which global information about the network topology influences the routing patterns of neural signals traversing the network.

Original languageEnglish
Article numbere1006833
Pages (from-to)1-24
Number of pages24
JournalPLoS Computational Biology
Volume15
Issue number3
DOIs
Publication statusPublished - 8 Mar 2019

Fingerprint

routing
animal communication
brain
Brain
Routing
Communication
Shortest path
Topology
communication
topology
Telecommunication networks
information networks
Dynamical systems
communication network
Network Communication
Information Services
Costs
Costs and Cost Analysis
System Dynamics
Network Topology

Cite this

Avena-Koenigsberger, A., Yan, X., Kolchinsky, A., van den Heuvel, M. P., Hagmann, P., & Sporns, O. (2019). A spectrum of routing strategies for brain networks. PLoS Computational Biology, 15(3), 1-24. [e1006833]. https://doi.org/10.1371/journal.pcbi.1006833
Avena-Koenigsberger, Andrea ; Yan, Xiaoran ; Kolchinsky, Artemy ; van den Heuvel, Martijn P. ; Hagmann, Patric ; Sporns, Olaf. / A spectrum of routing strategies for brain networks. In: PLoS Computational Biology. 2019 ; Vol. 15, No. 3. pp. 1-24.
@article{25f9bda6ccb24629a2262a3e62277789,
title = "A spectrum of routing strategies for brain networks",
abstract = "Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally {"}cheap{"} but inefficient. We introduce a stochastic model for network communication that combines local and global information about the network topology to generate biased random walks on the network. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communication processes at the limiting extremes. We implement the model on two cohorts of human connectome networks and investigate the effects of varying the global information bias on the network's communication cost. We identify routing strategies that approach a (highly efficient) shortest-path communication process with a relatively small global information bias on the system's dynamics. Moreover, we show that the cost of routing messages from and to hub nodes varies as a function of the global information bias driving the system's dynamics. Finally, we implement the model to identify individual subject differences from a communication dynamics point of view. The present framework departs from the classical shortest paths vs. diffusion dichotomy, unifying both models under a single family of dynamical processes that differ by the extent to which global information about the network topology influences the routing patterns of neural signals traversing the network.",
author = "Andrea Avena-Koenigsberger and Xiaoran Yan and Artemy Kolchinsky and {van den Heuvel}, {Martijn P.} and Patric Hagmann and Olaf Sporns",
year = "2019",
month = "3",
day = "8",
doi = "10.1371/journal.pcbi.1006833",
language = "English",
volume = "15",
pages = "1--24",
journal = "PLoS Computational Biology",
issn = "1553-734X",
publisher = "Public Library of Science",
number = "3",

}

Avena-Koenigsberger, A, Yan, X, Kolchinsky, A, van den Heuvel, MP, Hagmann, P & Sporns, O 2019, 'A spectrum of routing strategies for brain networks' PLoS Computational Biology, vol. 15, no. 3, e1006833, pp. 1-24. https://doi.org/10.1371/journal.pcbi.1006833

A spectrum of routing strategies for brain networks. / Avena-Koenigsberger, Andrea; Yan, Xiaoran; Kolchinsky, Artemy; van den Heuvel, Martijn P.; Hagmann, Patric; Sporns, Olaf.

In: PLoS Computational Biology, Vol. 15, No. 3, e1006833, 08.03.2019, p. 1-24.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - A spectrum of routing strategies for brain networks

AU - Avena-Koenigsberger, Andrea

AU - Yan, Xiaoran

AU - Kolchinsky, Artemy

AU - van den Heuvel, Martijn P.

AU - Hagmann, Patric

AU - Sporns, Olaf

PY - 2019/3/8

Y1 - 2019/3/8

N2 - Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally "cheap" but inefficient. We introduce a stochastic model for network communication that combines local and global information about the network topology to generate biased random walks on the network. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communication processes at the limiting extremes. We implement the model on two cohorts of human connectome networks and investigate the effects of varying the global information bias on the network's communication cost. We identify routing strategies that approach a (highly efficient) shortest-path communication process with a relatively small global information bias on the system's dynamics. Moreover, we show that the cost of routing messages from and to hub nodes varies as a function of the global information bias driving the system's dynamics. Finally, we implement the model to identify individual subject differences from a communication dynamics point of view. The present framework departs from the classical shortest paths vs. diffusion dichotomy, unifying both models under a single family of dynamical processes that differ by the extent to which global information about the network topology influences the routing patterns of neural signals traversing the network.

AB - Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which operates according to local topological features, is informationally "cheap" but inefficient. We introduce a stochastic model for network communication that combines local and global information about the network topology to generate biased random walks on the network. The model generates a continuous spectrum of dynamics that converge onto shortest-path and random-walk (diffusion) communication processes at the limiting extremes. We implement the model on two cohorts of human connectome networks and investigate the effects of varying the global information bias on the network's communication cost. We identify routing strategies that approach a (highly efficient) shortest-path communication process with a relatively small global information bias on the system's dynamics. Moreover, we show that the cost of routing messages from and to hub nodes varies as a function of the global information bias driving the system's dynamics. Finally, we implement the model to identify individual subject differences from a communication dynamics point of view. The present framework departs from the classical shortest paths vs. diffusion dichotomy, unifying both models under a single family of dynamical processes that differ by the extent to which global information about the network topology influences the routing patterns of neural signals traversing the network.

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

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

U2 - 10.1371/journal.pcbi.1006833

DO - 10.1371/journal.pcbi.1006833

M3 - Article

VL - 15

SP - 1

EP - 24

JO - PLoS Computational Biology

JF - PLoS Computational Biology

SN - 1553-734X

IS - 3

M1 - e1006833

ER -

Avena-Koenigsberger A, Yan X, Kolchinsky A, van den Heuvel MP, Hagmann P, Sporns O. A spectrum of routing strategies for brain networks. PLoS Computational Biology. 2019 Mar 8;15(3):1-24. e1006833. https://doi.org/10.1371/journal.pcbi.1006833