Spring 2017

Random Walks on Ramanujan Graphs, Digraphs and Complexes

Wednesday, February 1st, 2017 11:40 am12:25 pm

Add to Calendar

We will discuss the sharp transition in the time it takes simple random walk on regular Ramanujan graphs to approach the uniform distribution (known as the cutoff phenomenon), and geometric consequences (such as typical distances between vertices) that this implies for such graphs. We will then discuss how these ideas can be extended to regular Ramanujan digraphs, and consequently, to any d-dimensional Ramanujan complexes for d>1 associated with a simple group, with analogous geometric implications for these objects.

Base on joint works with Y. Peres and with A. Lubotzky and O. Parzanchevski.