Optimal Location of Sources in Transportation Networks

Abstract

We consider the problem of optimizing the locations of source nodes in transportation networks. A reduction of the fraction of surplus nodes induces a glassy transition. In contrast to most constraint satisfaction problems involving discrete variables, our problem involves continuous variables which lead to cavity fields in the form of functions. The one-step replica symmetry breaking (1RSB) solution involves solving a stable distribution of functionals, which is in general infeasible. In this paper, we obtain small closed sets of functional cavity fields and demonstrate how functional recursions are converted to simple recursions of probabilities, which make the 1RSB solution feasible. The physical results in the replica symmetric (RS) and the 1RSB frameworks are thus derived and the stability of the RS and 1RSB solutions are examined.

38 pages, 18 figures

References in corpus (5)

• Phase Transitions in the Coloring of Random Graphs
• Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs
• A Lattice Model for Colloidal Gels and Glasses
• Inference and Optimization of Real Edges on Sparse Graphs - A Statistical Physics Perspective
• Optimal Location of Sources in Transportation Networks

Cited by in corpus (5)

• Networking - A Statistical Physics Perspective
• The Competition for Shortest Paths on Sparse Graphs
• Optimal Location of Sources in Transportation Networks
• The network source location problem: ground state energy, entropy and effects of freezing
• Bilevel optimization in flow networks: A message-passing approach