Cutoff for the random walk on random directed graphs

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

• Justin Salez
• Tuesday 09 February 2016, 16:30-17:30
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Perla Sousi.

Originally discovered in the context of card shuffling (Aldous-Diaconis, 80’s), the cutoff phenomenon has since then been established for many reversible Markov chains arising in a broad variety of contexts. In this talk we consider the non-reversible case of random walks on large directed graphs, for which even the equilibrium measure is far from being understood. For most bounded-degree graphs, we establish the cutoff phenomenon, determine its precise window and prove that the cutoff profile approaches a universal shape. This is joint work with Charles Bordenave and Pietro Caputo.

This talk is part of the Probability series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.