Broutin, N. and Lugosi, G. (2010) The longest minimum-weight path in a complete graph. Combin. Probab. Comput.
Aldous, D. (1992) Asymptotics in the random assignment problem. Probab. Theory Rel. Fields
Aldous, D. J. (2001) The ζ (2) limit in the random assignment problem. Random Struct. Alg.
Aldous, D. J. (2010) More uses of exchangeability: Representations of complex random structures. In Probability and Mathematical Genetics: Papers in Honour of Sir John Kingman (Bingham, N. H. and Goldie, C. M., eds), London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 35–63.
Aldous, D. J. and Bhamidi, S. (2010) Edge flows in the complete random-lengths network. Random Struct. Alg.
Aldous, D. and Steele, J. M. (2004) The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures (Kesten, H., ed.), Vol. 110 of Encyclopaedia of Mathematical Sciences, Springer, pp. 1–72.
Amini, H. and Lelarge, M. (2015) The diameter of weighted random graphs. Ann. Appl. Probab.
Amini, H. and Peres, Y. (2014) Shortest-weight paths in random regular graphs. SIAM J. Discrete Math.
Barbour, A. D., Holst, L. and Janson, S. (1992) Poisson Approximation, Vol. 2 of Oxford Studies in Probability, The Clarendon Press, Oxford University Press.
Bhamidi, S. (2008) First passage percolation on locally treelike networks I: Dense random graphs. J. Math. Phys.
Bhamidi, S., van der Hofstad, R. and Hooghiemstra, G. (2010) First passage percolation on random graphs with finite mean degrees. Ann. Appl. Probab.
Devroye, L. (1987) Branching processes in the analysis of the heights of trees. Acta Informatica
Ding, J., Kim, J. H., Lubetzky, E. and Peres, Y. (2010) Diameters in supercritical random graphs via first passage percolation. Combin. Probab. Comput.
Ding, J., Kim, J. H., Lubetzky, E. and Peres, Y. (2011) Anatomy of a young giant component in the random graph. Random Struct. Alg.
Frieze, A. M. (1985) On the value of a random minimum spanning tree problem. Discrete Appl. Math.
Goldstein, L. and Rinott, Y. (2007) Functional BKR inequalities, and their duals, with applications. J. Theoret. Probab.
Janson, S. (1995) The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Struct. Alg.
Janson, S. (1999) One, two and three times log n/n for paths in a complete graph with random weights. Combin. Probab. Comput.
Kemperman, J. H. B. (1977) On the FKG-inequality for measures on a partially ordered space. Indag. Math.
Kingman, J. F. C. (1993) Poisson Processes, Vol. 3 of Oxford Studies in Probability, The Clarendon Press, Oxford University Press.
Pittel, B. (1994) Note on the heights of random recursive trees and random m-ary search trees. Random Struct. Alg.
Riordan, O. and Wormald, N. (2010) The diameter of sparse random graphs. Combin. Probab. Comput.
Salez, J. (2013) Joint distribution of distances in large random regular networks. J. Appl. Probab.
Smythe, R. T. and Mahmoud, H. M. (1994) A survey of recursive trees. Teor. Ĭmovīr. Mat. Stat.
Wästlund, J. (2010) The mean field traveling salesman and related problems. Acta Mathematica