Transport in networks with multiple sources and sinks
arXiv:0805.1567 · doi:10.1209/0295-5075/84/28005
Abstract
We investigate the electrical current and flow (number of parallel paths) between two sets of n sources and n sinks in complex networks. We derive analytical formulas for the average current and flow as a function of n. We show that for small n, increasing n improves the total transport in the network, while for large n bottlenecks begin to form. For the case of flow, this leads to an optimal n* above which the transport is less efficient. For current, the typical decrease in the length of the connecting paths for large n compensates for the effect of the bottlenecks. We also derive an expression for the average flow as a function of n under the common limitation that transport takes place between specific pairs of sources and sinks.
References in corpus (12)
- Statistical mechanics of complex networks
- Resilience of the Internet to random breakdowns
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- First-passage times in complex scale-invariant media
- Scaling theory of transport in complex networks
- Transport in weighted networks: Partition into superhighways and roads
- Communication Bottlenecks in Scale-Free Networks
- Anomalous Transport in Complex Networks
- Transport and Percolation Theory in Weighted Networks
- Maximum flow and topological structure of complex networks
- Transport of multiple users in complex networks
Cited by in corpus (10)
- Transport on coupled spatial networks
- Optimizing transport efficiency on scale-free networks through assortative or dissortative topology
- Resiliently evolving supply-demand networks
- Controlling congestion on complex networks: fairness, efficiency and network structure
- The path most travelled: Mining road usage patterns from massive call data
- Optimal transport on supply-demand networks
- Morphological organization of point-to-point transport in complex networks
- Traffic Divergence Theory: An Analysis Formalism for Dynamic Networks
- Growth of a tree with allocations rules: Part 2 Dynamics
- Growth of a tree with allocations rules: Part 1 Kinematics