Optimal Resource Allocation in Random Networks with Transportation Bandwidths
arXiv:0808.3364 · doi:10.1088/1742-5468/2009/03/P03029
Abstract
We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Useful algorithms are obtained from recursive relations. Bottlenecks emerge when the bandwidths are small, causing an increase in the fraction of idle links. For a given total bandwidth per node, the efficiency of allocation increases with the network connectivity. In the high connectivity limit, we find a phase transition at a critical bandwidth, above which clusters of balanced nodes appear, characterised by a profile of homogenized resource allocation similar to the Maxwell's construction.
28 pages, 11 figures
References in corpus (7)
- Emergence of scaling in random networks
- The random K-satisfiability problem: from an analytic solution to an efficient algorithm
- Structure, Scaling and Phase Transition in the Optimal Transport Network
- Structure of Optimal Transport Networks Subject to a Global Constraint
- Finite-connectivity systems as error-correcting codes
- Equilibration through local information exchange in networks
- Inference and Optimization of Real Edges on Sparse Graphs - A Statistical Physics Perspective