University of Cambridge > Talks.cam > Rollo Davidson Lectures > Random walk on the random graph

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Random walk on the random graph

Download to your calendar using vCal

If you have a question about this talk, please contact HoD Secretary, DPMMS .

*Fourth Rollo Davidson Lecture

I will discuss the behavior of the random walk on two random graph models: on one hand the random regular graph with constant degree, and on the other hand the giant component of the supercritical Erdos-Renyi random graph with constant average degree. In the former case it is known that the walk mixes in logarithmic time and exhibits the cutoff phenomenon. In the latter case, while starting from the worst trap delays mixing and precludes cutoff, it turns out that starting from a fixed vertex induces the rapid mixing behavior of the regular case. (Joint work with Nathanael Berestycki, Eyal Lubetzky and Allan Sly.)

This talk is part of the Rollo Davidson Lectures series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Bateman Auditorium, Gonville & Caius College, Cambridge, CB2 1TA Senior Parlour, Gonville & Caius College To be confirmed

Other talks

Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Animating urbanism: the demotic multiplicities of seeing cities digitally Group Work Sheref Mansy, topic TBA Machine Learning for Spectral Geometry and Vice Versa Online Causal Inference Seminar
 

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