Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Spectral gaps for random Schreier graphs

Spectral gaps for random Schreier graphs

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

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

OGGW03 - Spectral gaps

I will discuss a generalization of Friedman’s theorem, focusing on the spectral gap of the random regular Schreier graphs associated with the action of S_n on K_n—tuples of distinct elements in {1,...,n}. The proof relies on the `polynomial method’, a new approach to strong convergence of Chen, Garza—Vargas, Tropp and van Handel, combined with new group theoretic inputs. A key ingredient is a new asymptotic bound on the expected character of a random permutation obtained via a word map, which is expressed in terms of the dimension of the corresponding representation. 

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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