Summary: Edge Flows in the Complete
Random-Lengths Network*
David J. Aldous,1
Shankar Bhamidi2
1
Department of Statistics, University of California, Berkeley, California 94720-3860;
e-mail: aldous@stat.berkeley.edu
2
Department of Statistics, University of North Carolina, Chapel Hill, North Carolina
27599; e-mail: hamidi@email.unc.edu
Received 30 July 2007; accepted 28 November 2008; received in final form 18 February 2009
Published online 28 January 2010 in Wiley Online Library (wileyonlinelibrary.com).
DOI 10.1002/rsa.20306
ABSTRACT: Consider the complete n-vertex graph whose edge-lengths are independent exponen-
tially 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. Random Struct. Alg., 37, 271­311, 2010
Keywords: flow; percolation tree; random graph; random network
1. INTRODUCTION

Source: Aldous, David J. - Department of Statistics, University of California at Berkeley

Collections: Mathematics