A spectrum of routing strategies for brain networks

2018-03-22

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 varying amounts of local and global information about the network topology. 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 amounts of local and global information on the network's communication cost. We identify routing strategies that approach a (highly efficient) shortest-path communication process with a relatively small amount of global information. Moreover, we show that the cost of routing messages from and to hub nodes varies as a function of the amount of global information 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, suggesting instead that brain networks may exhibit different types of communication dynamics depending on varying functional demands and the availability of resources.

📄 PDF Abstract BibTeX arXiv:1803.08541

Code (0)

등록된 구현이 없습니다.

Optimal navigability of weighted human brain connectomes in physical space

2023-11-17 · Laia Barjuan, Jordi Soriano, M. Ángeles Serrano

The architecture of the human connectome supports efficient communication protocols relying either on distances between brain regions or on the intensities of connections. However, none of these protocols combines inform…

Diversity

Cost-Aware Contrastive Routing for LLMs

2025-08-17 · Reza Shirkavand, Shangqian Gao, Peiran Yu, Heng Huang arxiv

We study cost-aware routing for large language models across diverse and dynamic pools of models. Existing approaches often overlook prompt-specific context, rely on expensive model profiling, assume a fixed set of exper…

Scalable Deep Reinforcement Learning for Routing and Spectrum Access in Physical Layer

2020-12-22 · Wei Cui, Wei Yu

This paper proposes a novel scalable reinforcement learning approach for simultaneous routing and spectrum access in wireless ad-hoc networks. In most previous works on reinforcement learning for network optimization, th…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

BrainStack: Neuro-MoE with Functionally Guided Expert Routing for EEG-Based Language Decoding

2026-01-29 · Ziyi Zhao, Jinzhao Zhou, Xiaowei Jiang, Beining Cao 외 arxiv

Decoding linguistic information from electroencephalography (EEG) remains challenging due to the brain's distributed and nonlinear organization. We present BrainStack, a functionally guided neuro-mixture-of-experts (Neur…

CONCUR: A Framework for Continual Constrained and Unconstrained Routing

2025-12-10 · Peter Baile Chen, Weiyue Li, Dan Roth, Michael Cafarella 외 arxiv

AI tasks differ in complexity and are best addressed with different computation strategies (e.g., combinations of models and decoding methods). Hence, an effective routing system that maps tasks to the appropriate strate…