Edge Flows in the Complete Random-Lengths Network

Details Edge Flows in the Complete Random-Lengths Network Edge Flows in the Complete Random-Lengths Network

2007-08-03

arxiv.org/abs/0708.0555v1

Mathematics

Probability

38 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Edge Flows in the Complete Random-Lengths Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Edge Flows in the Complete Random-Lengths Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge Flows in the Complete Random-Lengths Network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602274