Theo McKenzie | Spectral statistics for sparse random graphs

Опубликовано: 04 Июнь 2026
на канале: Harvard CMSA
194
1

GRAMSIA 5/16/2023

Speaker: Theo McKenzie (Harvard)

Title: Spectral statistics for sparse random graphs

Abstract: Understanding the eigenvectors and eigenvalues of the adjacency matrix of random graphs is fundamental to many algorithmic questions; moreover, it is related to longstanding questions in quantum physics. In this talk we focus on random models of sparse graphs, giving some properties that are unique to these sparse graphs, as well as some specific obstacles. Based on this, we show some new results on spectral statistics of sparse random graphs, as well as some conjectures.