Flows on Graphs with Random Capacities
arXiv:cond-mat/0609145 · doi:10.1103/PhysRevE.74.051110
Abstract
We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold that depends on the distribution of capacities. We then examine the maximal total flux from the root to the leaves. Our methods generalize to simple graphs with loops, e.g., to hierarchical lattices and to complete graphs.
8 pages, 6 figures
References in corpus (11)
- Organization of Growing Random Networks
- Anomalous Transport in Complex Networks
- Extremal Paths on a Random Cayley Tree
- Statistics of Lead Changes in Popularity-Driven Systems
- Clogging Time of a Filter
- Gradient Clogging in Depth Filtration
- Effect of Disorder Strength on Optimal Paths in Complex Networks
- Optimizing transport in a homogeneous network
- Collective Particle Flow through Random Media
- Maximum flow and topological structure of complex networks
- Slow relaxation due to optimization and restructuring: Solution on a hierarchical lattice