Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Abstract : We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We give direct proofs of the analogs for the shortest path problem of some results established by D. Aldous in connection with his $\zeta (2)$ limit theorem for the assignment problem.
https://hal.inria.fr/hal-01184708 Contributor : Coordination Episciences IamConnect in order to contact the contributor Submitted on : Monday, August 17, 2015 - 2:24:54 PM Last modification on : Thursday, May 11, 2017 - 1:02:51 AM Long-term archiving on: : Wednesday, November 18, 2015 - 12:10:07 PM
Johan Wästlund. Random assignment and shortest path problems. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.31-38, ⟨10.46298/dmtcs.3504⟩. ⟨hal-01184708⟩