Related Experiment Video
Updated: Aug 8, 2026

Modeling the Functional Network for Spatial Navigation in the Human Brain
Published on: October 13, 2023
Transport in weighted networks: partition into superhighways and roads
Zhenhua Wu1, Lidia A Braunstein, Shlomo Havlin
1Center for Polymer Studies, Boston University, Boston, MA 02215, USA.
Abstract:
Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree connecting all nodes with the minimum total weight. We find that the MST can be partitioned into two distinct components, having significantly different transport properties, characterized by centrality--the number of times a node (or link) is used by transport paths. One component, superhighways, is the infinite incipient percolation cluster, for which we find that nodes (or links) with high centrality dominate. For the other component, roads, which includes the remaining nodes, low centrality nodes dominate. We find also that the distribution of the centrality for the infinite incipient percolation cluster satisfies a power law, with an exponent smaller than that for the entire MST. The significance of this finding is that one can improve significantly the global transport by improving a tiny fraction of the network, the superhighways.
Related Concept Videos
Short-distance Transport of Resources
Reynolds Transport Theorem
Distributed Loads: Problem Solving
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Design Example: Alignment of a Road Line Using GIS
Traveling Waves: Lossless Lines

