Explore the intricacies of spectral statistics in random regular graphs through a 42-minute lecture delivered by Harvard University's Horng-Tzer Yau at the Fields Institute. Delve into advanced mathematical concepts and their applications in graph theory, gaining insights into the latest research in this field. Scheduled for August 15th, 2024, as part of the FFFM-2024 program, this talk promises to offer valuable knowledge for mathematicians, computer scientists, and researchers interested in graph theory and spectral analysis.
Spectral Statistics of Random Regular Graphs
Overview
Syllabus
Spectral statistics of Random regular graphs
Taught by
Fields Institute
Related Courses
-
Sharp Threshold for Rigidity of Random Graphs
-
Scaling Exponents in Stationary Random Graphs
-
Eulerian Magnitude Homology - Subgraph Structure and Random Graphs
-
Poisson U Statistics Subgraph and Component Counts in Random Geometric Graphs
-
Correspondence Colouring of Random Graphs
-
Spectrum of Sparse Inhomogeneous Random Graphs
