Spectral radii of sparse random matrices

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

• Antti Knowles (Geneva)
• Tuesday 07 March 2017, 15:15-16:15
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

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

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\’enyi graphs. For the Erd\H{o}s-R\’enyi graph $G(n,d/n)$, our results imply that the smallest and second-largest eigenvalues of the adjacency matrix converge to the edges of the support of the asymptotic eigenvalue distribution provided that $d \gg \log n$. This establishes a crossover in the behaviour of the extremal eigenvalues around $d \sim \log n$. Our results also apply to non-Hermitian sparse random matrices, corresponding to adjacency matrices of directed graphs. Joint work with Florent Benaych-Georges and Charles Bordenave.

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.