University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Distances in large random regular networks

Distances in large random regular networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Stochastic Processes in Communication Sciences

We 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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity