Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T20:11:23.261Z Has data issue: false hasContentIssue false

Joint Distribution of Distances in Large Random Regular Networks

Published online by Cambridge University Press:  30 January 2018

Justin Salez*
Affiliation:
University of California, Berkeley
*
∗ Current address: Université Paris Diderot, LPMA, Site Chevaleret, case 7012, 75205 Paris Cedex 13, France. Email address: justin.salez@univ-paris-diderot.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We study the array of point-to-point distances in random regular graphs equipped with exponential edge lengths. We consider the regime where the degree is kept fixed while the number of vertices tends to ∞. The marginal distribution of an individual entry is now well understood, thanks to the work of Bhamidi, van der Hofstad and Hooghiemstra (2010). The purpose of this note is to show that the whole array, suitably recentered, converges in the weak sense to an explicit infinite random array. Our proof consists in analyzing the invasion of the network by several mutually exclusive flows emanating from different sources and propagating simultaneously along the edges.

Information

Type
Research Article
Copyright
© Applied Probability Trust