Cost–Volume Relationship for Flows Through a Disordered Network

References

• Aldous D. J. Asymptotics in the random assignment problem. Probab. Theory Related Fields (1992) 93:507–534Crossref, Google Scholar
• Aldous D. J. The ζ(2) limit in the random assignment problem. Random Structures Algorithms (2001) 18:381–418Crossref, Google Scholar
• Aldous D. J. Percolation-like scaling exponents for minimal paths and trees in the stochastic mean-field model. Proc. Roy. Soc. Lond. Ser. A Math. Phys. Engrg. Sci. (2005) 461:825–838Crossref, Google Scholar
• Aldous D. J. Optimal flow through the disordered lattice. Ann. Probab. (2007) 35:397–438Crossref, Google Scholar
• Aldous D. J., Bandyopadhyay A. A survey of max-type recursive distributional equations. Ann. Appl. Probab. (2005) 15:1047–1110Crossref, Google Scholar
• Aldous D. J., Percus A. G. Scaling and universality in continuous length combinatorial optimization. Proc. Natl. Acad. Sci. USA (2003) 100:11211–11215Crossref, Google Scholar
• Aldous D. J., Steele J. M., Kesten H. The objective method: Probabilistic combinatorial optimization and local weak convergence. Probability on Discrete Structures, Encyclopaedia of Mathematical Sciences (2003) 110(Springer-Verlag, Berlin) 1–72Google Scholar
• Biggins J. D. Chernoff's theorem in the branching random walk. J. Appl. Probab. (1977) 14:630–636Crossref, Google Scholar
• Brightly D. A Java visualization of the PWIT. (2004) . http://www.stat.berkeley.edu/users/aldous/PWIT/PWITDemo.htmlGoogle Scholar
• Durrett R.Probability: Theory and Examples (1991) (Wadsworth, Pacific Grove, CA) Google Scholar
• Gamarnik D., Nowicki T., Swirszcz G. Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. Random Structures Algorithms (2006) 28(1):76–106Crossref, Google Scholar
• Gazis D. C.Traffic Theory (2002) (Kluwer, Boston) Google Scholar
• Grimmett G. R.Percolation (1999) 2nd ed.(Springer-Verlag, Berlin) Crossref, Google Scholar
• Hofri M.Analysis of Algorithms (1995) (Clarendon Press and Oxford University Press, New York) Google Scholar
• Kelly F. P. Network routing. Philos. Trans. Roy. Soc. Lond. A (1991) 337:343–367Crossref, Google Scholar
• Kesten H. Scaling relations for 2D-percolation. Comm. Math. Phys. (1987) 109(1):109–156Crossref, Google Scholar
• Kesten H. First-passage percolation: From classical to modern probability. Progress Probab. (2003) 54:93–143Google Scholar
• Mertens S., Mézard M., Zecchina R. Threshold values of random K-SAT from the cavity method. Random Structures Algorithms (2006) 28(3):340–373Crossref, Google Scholar
• Mézard M., Parisi G. A replica analysis of the travelling salesman problem. J. Physique (1986) 47:1285–1296Crossref, Google Scholar
• Mézard M., Parisi G. The cavity method at zero temperature. J. Statist. Phys. (2003) 111:1–34Crossref, Google Scholar
• Mézard M., Parisi G., Virasoro M. A.Spin Glass Theory and Beyond (1987) (World Scientific, Singapore) Google Scholar
• Newman M. E. J., Watts D. J., Strogatz S. H. Random graph models of social networks. Proc. Natl. Acad. Sci. USA (2002) 99(Suppl. 1):2566–2572Crossref, Google Scholar
• Steele J. M. Minimal spanning trees for graphs with random edge lengths. Mathematics and Computer Science II (2002) (Birkhäuser, Basel, Switzerland) 223–245Crossref, Google Scholar
• Talagrand M.Spin Glasses: A Challenge for Mathematicians (2003) (Springer-Verlag, Berlin) Google Scholar
• Wästlund J. The travelling salesman problem in the stochastic mean field model. (2006) . http://www.mai.liu.se/jowasGoogle Scholar