2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/135538Consider 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.38 pages, 4 figuresProbability60C05, 05C80, 90B15text