Random walk on the random graph

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

• Yuval Peres (Microsoft Research, Redmond)
• Friday 12 June 2015, 17:00-18:00
• MR2, CMS, Wilberforce Road, Cambridge, CB3 0WB.

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:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Faculty of Mathematics Lectures
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• MR2, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Rollo Davidson Lectures
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.