Distances in large random regular networks
Seminar Room 1, Newton Institute
AbstractWe study the array of point-to-point distances in large random regular graphs equipped with exponential edge-lengths. The asymptotic marginal distribution of a single entry is now well-understood, thanks to the work of Bhamidi, van der Hofstad and Hooghiemstra (2010). In this talk, we will show that the whole array, suitably recentered, converges in the weak sense to a rather simple infinite random array. This confirms a prediction of David Aldous.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.