Universality of Nodal Statistics of Random Matrices @SimonsInstitute
Universality of Nodal Statistics of Random Matrices  @SimonsInstitute
Uploaded November 2026 | Updated November 2026, 3 days ago
Kyle Luh (University of Colorado Boulder)
https://simons.berkeley.edu/talks/kyle-luh-university-colorado-boulder-2026-11-02
Beyond Graph Laplacians

Nodal statistics turn an eigenvector into a geometric or combinatorial object by recording where its signs are compatible with the operator. We establish a central limit theorem for the nodal statistics of the k-th eigenvector of an orthogonally invariant ensemble of random matrices. This resolves a conjecture of Alon, Mikulincer and Urschel. To attack this problem, we develop some random matrix and combinatorial machinery that may be of independent interest. This is joint work with G. Berkolaiko.
Universality of Nodal Statistics of Random MatricesLarge scale consequences of non-negative Ollivier-Ricci curvatureOn Zeros and Algorithms for Disordered SystemsSymmetric Self-Dual Quantum Codes on High Dimensional Expanders with Single-Orbit Low-Weight ChecksOptimal Inference Schedules for Masked Diffusion ModelsFinite-particles rates for drifting modelsOn the interplay of accuracy and fairness in computational healthcareRecovering Riemannian metric distance from Random Geometric GraphsIn Search of Missing Mass: Disentangling Discoveries from HallucinationsExplicit lossless vertex expandersQuantum ergodicity on graphs (Part 2)Convex-body Sampling to the Kannan-Lovász-Simonovits Conjecture
Simons Institute for the Theory of Computing |

Universality of Nodal Statistics of Random Matrices

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER