Free SKILL.md scraped from GitHub. Clone the repo or copy the file directly into your Claude Code skills directory.
npx versuz@latest install hiyenwong-ai-collection-collection-skills-adaptive-flow-routing-brain-network-communicatgit clone https://github.com/hiyenwong/ai_collection.gitcp ai_collection/SKILL.MD ~/.claude/skills/hiyenwong-ai-collection-collection-skills-adaptive-flow-routing-brain-network-communicat/SKILL.md---
name: adaptive-flow-routing-brain-network-communication
description: "Adaptive flow routing for brain network communication modeling. Exploits topological features (communication efficiency and latency) to reveal hidden communication patterns in macroscopic brain networks. Extends shortest-path routing with adaptive, biologically plausible flow dynamics. Activation: brain communication, flow routing, network topology, communication efficiency, connectome routing."
---
# Adaptive Flow Routing in Brain Network Communication
> Adaptive flow routing leverages topological features of connectome graphs — communication efficiency and latency — to model how macroscopic brain networks route information beyond simple shortest-path assumptions.
## Metadata
- **Source**: arXiv:2602.00561
- **Authors**: Q. Liu, M. P. van den Heuvel, P. R. Hof
- **Published**: 2026-02-03
- **Category**: q-bio.NC
## Core Methodology
### Key Innovation
Traditional brain communication models assume routing along shortest paths (or diffusive navigation). This work introduces **adaptive flow routing** that:
1. Considers not just path length but **communication efficiency** (edge capacity / congestion)
2. Incorporates **transmission latency** from network topology
3. Routes flow adaptively based on local network state — biologically more plausible than rigid shortest-path
### Technical Framework
1. **Connectome Graph Construction**: Build weighted directed graph from structural connectivity (DTI tractography or tracer studies)
2. **Edge Capacity Assignment**: Assign communication capacity to edges based on:
- Fiber density / streamline count
- Myelination level proxies
- Regional hubness scores
3. **Latency Estimation**: Compute transmission delay for each edge based on:
- Physical distance between regions
- Conduction velocity estimates
- Synaptic relay delays at intermediate nodes
4. **Adaptive Routing Algorithm**: Multi-commodity flow optimization:
- Maximize total communication efficiency across all source-target pairs
- Subject to edge capacity constraints and latency bounds
- Flow splits across multiple paths (not just shortest)
5. **Communication Pattern Analysis**: Extract:
- Hub bypass ratios (how much flow avoids hubs)
- Detour indices (path stretch vs. shortest path)
- Communication diversity (entropy of path usage)
### Key Results
- Adaptive routing reveals communication patterns invisible to shortest-path methods
- Hub regions show high bypass ratios — flow actively avoids congested hubs
- Latency-aware routing matches empirical functional connectivity better than shortest-path
- Communication efficiency correlates with cognitive task performance
## Implementation Guide
### Prerequisites
- Structural connectome (weighted, directed adjacency matrix)
- Regional coordinates or distance matrix
- Python: numpy, scipy, networkx
### Step-by-Step
1. **Graph setup**: Construct directed weighted graph from connectome
2. **Capacity assignment**: Map fiber density to edge capacities
3. **Latency computation**: Compute per-edge delays from distance and conduction estimates
4. **Routing optimization**: Solve multi-commodity flow with efficiency + latency objectives
5. **Pattern extraction**: Analyze routing paths for communication features
6. **Validation**: Compare predicted communication patterns with empirical FC
### Code Example
```python
import numpy as np
import networkx as nx
from scipy.sparse import csr_matrix
def compute_edge_capacity(adjacency, fiber_densities):
# Normalize fiber densities to capacities.
cap = fiber_densities / fiber_densities.max()
return cap * adjacency
def compute_latency(dist_matrix, conduction_velocity=5.0):
# Estimate transmission latency from inter-regional distances.
# conduction_velocity in m/s (typical corticocortical: 3-10 m/s)
return dist_matrix / (conduction_velocity * 1000) # seconds
def adaptive_route(graph, source, target, capacity_attr='capacity',
latency_attr='latency', n_paths=5):
# Find multiple adaptive routing paths between source and target.
paths = []
residual = graph.copy()
for _ in range(n_paths):
try:
# Weight edges by composite of latency and inverse capacity
for u, v in residual.edges():
cap = residual[u][v].get(capacity_attr, 1.0)
lat = residual[u][v].get(latency_attr, 0.1)
residual[u][v]['weight'] = lat / max(cap, 0.01)
path = nx.shortest_path(residual, source, target, weight='weight')
paths.append(path)
# Reduce capacity along used path
for i in range(len(path)-1):
residual[path[i]][path[i+1]][capacity_attr] *= 0.5
except nx.NetworkXNoPath:
break
return paths
def communication_efficiency(graph, paths, capacity_attr='capacity'):
# Compute total communication efficiency across routing paths.
total_flow = 0
for path in paths:
min_cap = min(
graph[path[i]][path[i+1]].get(capacity_attr, 1.0)
for i in range(len(path)-1)
)
total_flow += min_cap
return total_flow
```
## Applications
- **Connectome communication modeling**: Predict functional connectivity from structural wiring
- **Hub function analysis**: Quantify how much communication bypasses vs. transits through hubs
- **Network dysfunction**: Identify disrupted routing in neurological disorders
- **Optimal stimulation targets**: Find nodes whose stimulation maximally reroutes communication
- **Comparative neuroanatomy**: Compare routing efficiency across species
## Pitfalls
- Structural connectome quality strongly affects routing results
- Conduction velocity estimates vary widely across fiber populations
- Multi-commodity flow optimization is NP-hard — heuristics needed for large networks
- Directionality of connections often unknown from non-invasive imaging
## Related Skills
- brain-network-controllability
- brain-connectivity-analysis
- flow-based-connectivity-distribution
- linear-structure-function-coupling