Skip to main content
eScholarship
Open Access Publications from the University of California
Refine Search

UC Berkeley

UC Berkeley Previously Published Works bannerUC Berkeley

Edge flows in the complete random‐lengths network

Published Web Location

https://doi.org/10.1002/rsa.20306
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.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.


Top