2007/08/03 by David Aldous, David J. Aldous, Shankar Bhamidi +2
Computer Science · Mathematics · Physics and Astronomy · #05C80 #60C05 #90B15 #Complex Network Analysis Techniques #FOS: Mathematics #Opinion Dynamics and Social Influence #Probability (math.PR) #Topological and Geometric Data Analysis #math.PR #msc:05C80 #msc:60C05 #msc:90B15
paper · pdf · doi:10.48550/arxiv.0708.0555
38 pages, 4 figures
arxiv created 2007/08/03 · openalex publication_date 2007/08/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.