Journal
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT
Volume -, Issue -, Pages -Publisher
IOP PUBLISHING LTD
DOI: 10.1088/1742-5468/2014/07/P07009
Keywords
cavity and replica method; message-passing algorithms; optimization over networks
Categories
Funding
- Marie Curie Training Network NETADIS (FP7) [290038]
- EU FET FP7 project STAMINA [FP7-265496]
- Royal Society Exchange Grant [IE110151]
- Laboratoire d'Excellence Physics Atom Light Matter (LabEx PALM) by the French National Research Agency (ANR) as part of the Investissements d'Avenir program [ANR-10-LABX-0039]
- Research Grants Council of Hong Kong [605010, 604512]
Ask authors/readers for more resources
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 analyzed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
