Edge flows in the complete random-lengths network
From MaRDI portal
Publication:3055894
DOI10.1002/rsa.20306zbMath1209.05115arXiv0708.0555OpenAlexW3083548150MaRDI QIDQ3055894
David J. Aldous, Shankar Bhamidi
Publication date: 10 November 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.0555
Related Items (8)
PRESERVATION OF LOG-CONCAVITY UNDER CONVOLUTION ⋮ Diameter of the Stochastic Mean-Field Model of Distance ⋮ Uniform multicommodity flows in the hypercube with random edge‐capacities ⋮ Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks ⋮ Uniform multicommodity flow through the complete graph with random edge-capacities ⋮ Return to the Poissonian city ⋮ Joint Distribution of Distances in Large Random Regular Networks ⋮ A conversation with David J. Aldous
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic fringe distributions for general families of random trees
- Universality for the distance in finite variance random graphs
- On the value of a random minimum spanning tree problem
- First-passage percolation on the square lattice
- The flooding time in random graphs
- A proof of Parisi's conjecture on the random assignment problem
- The cavity method at zero temperature
- Statistical mechanics of complex networks
- First passage percolation on locally treelike networks. I. Dense random graphs
- The Structure and Function of Complex Networks
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Percolation–like scaling exponents for minimal paths and trees in the stochastic mean field model
- Scaling and universality in continuous length combinatorial optimization
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
This page was built for publication: Edge flows in the complete random-lengths network
