Edge Flows in the Complete Random-Lengths Network
Probability
2007-08-06 v1
Abstract
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 limit we find explicitly the empirical distribution of these edge-flows, suitably normalized.
Cite
@article{arxiv.0708.0555,
title = {Edge Flows in the Complete Random-Lengths Network},
author = {David J. Aldous and Shankar Bhamidi},
journal= {arXiv preprint arXiv:0708.0555},
year = {2007}
}
Comments
38 pages, 4 figures