# Random assignment and shortest path problems

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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [14 references]

https://hal.inria.fr/hal-01184708
Contributor : Coordination Episciences Iam <>
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

### File

dmAG0102.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01184708, version 1

### Citation

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. ⟨hal-01184708⟩

Record views