Edge Flows in the Complete Random-Lengths Network

Simple item page
dc.creatorAldous, David J.
dc.creatorBhamidi, Shankar
dc.date2007-08-03
dc.date.accessioned2026-07-07T08:22:06Z
dc.date.available2026-07-07T08:22:06Z
dc.descriptionConsider 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.
dc.description38 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0708.0555
dc.identifierhttp://arxiv.org/abs/0708.0555
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135538
dc.subjectProbability
dc.subject60C05, 05C80, 90B15
dc.titleEdge Flows in the Complete Random-Lengths Network
dc.typetext

Files

Collections

arXiv