Edge Flows in the Complete Random-Lengths Network

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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 \to \infty$ limit we find explicitly the empirical distribution of these edge-flows, suitably normalized.
38 pages, 4 figures

Keywords

Probability, 60C05, 05C80, 90B15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/135538

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0708.0555
 http://arxiv.org/abs/0708.0555

Collections

arXiv