Tail bounds for gaps between eigenvalues of sparse random matrices

From MaRDI portal
Publication:2076604




Abstract: We prove the first eigenvalue repulsion bound for sparse random matrices. As a consequence, we show that these matrices have simple spectrum, improving the range of sparsity and error probability from the work of the second author and Vu. As an application of our tail bounds, we show that for sparse ErdH{o}s--R'enyi graphs, weak and strong nodal domains are the same, answering a question of Dekel, Lee, and Linial.



Cites work







This page was built for publication: Tail bounds for gaps between eigenvalues of sparse random matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076604)