Optimal flow through the disordered lattice

DOI10.1214/009117906000000719zbMath1154.90003arXivmath/0511694OpenAlexW2014643389MaRDI QIDQ2371944

David J. Aldous

Publication date: 9 July 2007

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0511694

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Processes in random environments (60K37)

Related Items (3)

Asymptotic behavior of Aldous' gossip process ⋮ Uniform multicommodity flows in the hypercube with random edge‐capacities ⋮ Uniform multicommodity flow through the complete graph with random edge-capacities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surfaces with minimal random weights and maximal flows: a higher dimensional version of first-passage percolation
• The critical probability of bond percolation on the square lattice equals 1/2
• Probability theory of classical Euclidean optimization problems
• Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
• Convergence to equilibrium of random Ising models in the Griffiths phase.
• Bulk transport properties and exponent inequalities for random resistor and flow networks
• The cavity method at zero temperature
• Critical behavior for maximal flows on the cubic lattice
• First-passage percolation, network flows and electrical resistances
• Cost–Volume Relationship for Flows Through a Disordered Network
• Sharp thresholds of graph properties, and the $k$-sat problem
• A SHORT PROOF OF THE HARRIS–KESTEN THEOREM

This page was built for publication: Optimal flow through the disordered lattice