Johan Wästlund
-
Random assignment and shortest path problems
dmtcs:3504 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2006,
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
-
https://doi.org/10.46298/dmtcs.3504
Random assignment and shortest path problems
Authors: Johan Wästlund 1
NULL
Johan Wästlund
1 Department of Mathematics
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.
Bhamidi, Shankar; Goodman, Jesse; Van Der Hofstad, Remco; KomjĂĄthy, JĂşlia, 2015, Degree Distribution Of Shortest Path Trees And Bias Of Network Sampling Algorithms, The Annals Of Applied Probability, 25, 4, 10.1214/14-aap1036.
Krokhmal, Pavlo A.; Pardalos, Panos M., 2009, Random Assignment Problems, European Journal Of Operational Research, 194, 1, pp. 1-17, 10.1016/j.ejor.2007.11.062.
Van Mieghem, Piet, 2010, Weight Of A Link In A Shortest Path Tree And The Dedekind Eta Function, Random Structures And Algorithms, 36, 3, pp. 341-371, 10.1002/rsa.20299.