University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > On the graph limit approach to random regular graphs

On the graph limit approach to random regular graphs

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

If you have a question about this talk, please contact info@newton.ac.uk.

SNAW01 - Graph limits and statistics

Let G=G(n,d) denote the random d-regular graph on n vertices. A celebrated result by J. Friedman solves Alon's second eigenvalue conjecture saying that if d is fixed and n is large then G is close to be Ramanujan. Despite of significant effort, much less was known about the structure of the eigenvectors of G. We use a combination of graph limit theory and information theory to prove that every eigenvector of G (when normalized to have length equal to square root of n) has an entry distribution that is close to some Gaussian distribution in the weak topology. Our results also work in the more general setting of almost-eigenvectors. We hope our methods will lead to a general graph limit approach to a large class of problems on random regular graphs. Joint work with A. Backhausz.

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-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity