Edge Flows in the Complete Random-Lengths Network
Aldous, David J. ; Bhamidi, Shankar
arXiv, 0708.0555 / Harvested from arXiv
Text on arXiv
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some random total flow. In the $n \to \infty$ limit we find explicitly the empirical distribution of these edge-flows, suitably normalized.
Publié le : 2007-08-03
Classification:  Mathematics - Probability,  60C05, 05C80, 90B15 
@article{0708.0555,
     author = {Aldous, David J. and Bhamidi, Shankar},
     title = {Edge Flows in the Complete Random-Lengths Network},
     journal = {arXiv},
     volume = {2007},
     number = {0},
     year = {2007},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0708.0555}
}

Aldous, David J.; Bhamidi, Shankar. Edge Flows in the Complete Random-Lengths Network. arXiv, Tome 2007 (2007) no. 0, . http://gdmltest.u-ga.fr/item/0708.0555/