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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Distances in large random regular networks

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Emmanuel United Reform Church 72 Trumpington Street, CB2 1RR The Encyclopaedia of Literature in African Languages Average on weekdays: 9025.53639847 kWh

Other talks

Discussion II A flexible Monte Carlo quantitative bias analysis for unmeasured confounding Tea and Coffee Break Group Presentation 1 Royal Papworth Hospital and Acute Medicine New insights on the turbulent energy cascade from non-equilibrium statistical mechanics
 

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