Shortest node-disjoint paths on random graphs

Abstract

A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analysed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm.

22 pages, 14 figures

References in corpus (1)

• From the Physics of Interacting Polymers to Optimizing Routes on the London Underground

Cited by in corpus (9)

• Network extraction by routing optimization
• Sustainable optimal transport in multilayer networks
• The edge-disjoint path problem on random graphs by message-passing
• Multicommodity routing optimization for engineering networks
• Infrastructure adaptation and emergence of loops in network routing with time-dependent loads
• Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing
• Coordinating Dynamical Routes with Statistical Physics on Space-time Networks
• Bilevel optimization in flow networks: A message-passing approach
• Lattice Surgery Compilation Beyond the Surface Code