Equilibration through local information exchange in networks

Abstract

We study the equilibrium states of energy functions involving a large set of real variables, defined on the links of sparsely connected networks, and interacting at the network nodes, using the cavity and replica methods. When applied to the representative problem of network resource allocation, an efficient distributed algorithm is devised, with simulations showing full agreement with theory. Scaling properties with the network connectivity and the resource availability are found.

v1: 7 pages, 1 figure, v2: 4 pages, 2 figures, simplified analysis and more organized results, v3: minor changes

References in corpus (1)

• Cavity approach for real variables on diluted graphs and application to synchronization in small-world lattices

Cited by in corpus (12)

• Networking - A Statistical Physics Perspective
• The Competition for Shortest Paths on Sparse Graphs
• Inference and Optimization of Real Edges on Sparse Graphs - A Statistical Physics Perspective
• Minimizing Unsatisfaction in Colourful Neighbourhoods
• Optimal Resource Allocation in Random Networks with Transportation Bandwidths
• Optimal Location of Sources in Transportation Networks
• Evolving Powergrids in Self-Organized Criticality: An analogy with Sandpile and Earthquakes
• Coordinating Dynamical Routes with Statistical Physics on Space-time Networks
• Coverage versus Supply Cost in Facility Location: Physics of Frustrated Spin Systems
• The network source location problem: ground state energy, entropy and effects of freezing
• Self-Organization of Balanced Nodes in Random Networks with Transportation Bandwidths
• Bandwidth Allocation and Resource Adjustment for Stability Enhancement in Complex Networks