University of Cambridge > Talks.cam > Probability > Spectral radii of sparse random matrices

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Spectral radii of sparse random matrices

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Homerton,Mary Allan Building Hills Road, Cambridge CB2 8PQ, room 104 In person in the Max Perutz Lecture Theatre (CB2 0QH) and via Zoom, link: https://mrc-lmb-cam-ac-uk.zoom.us/j/95625236862?pwd=NGttT1d6ay9SWFRqUHMvRWNPdDhyZz09 LR3, Engineering Department, Inglis Building

Other talks

Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge Proteomics: Expression Analysis and Subcellular Localisation Why people with schizophrenia die earlier? Mortality and accelerated ageing Title abstract tbc Complete and Submit Project Choice Forms Grand Rounds - Equine
 

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