Edge flows in the complete random‐lengths network |
| |
| Authors: | David J Aldous Shankar Bhamidi |
| |
| Institution: | 1. Department of Statistics, University of California, Berkeley, California 94720‐3860;2. Department of Statistics, University of NorthCarolina, Chapel Hill, North Carolina 27599 |
| |
| 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 n→∞limit we find explicitly the empirical distribution of these edge‐flows, suitably normalized. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010 |
| |
| Keywords: | flow percolation tree random graph random network |
|
|
