Noise sensitivity for the top eigenvector of a sparse random matrix

From MaRDI portal
Publication:2136103

DOI10.1214/22-EJP770zbMATH Open1489.15048arXiv2106.09570OpenAlexW3171053211MaRDI QIDQ2136103FDOQ2136103

Charles Bordenave, Jaehun Lee

Publication date: 10 May 2022

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: We investigate the noise sensitivity of the top eigenvector of a sparse random symmetric matrix. Let v be the top eigenvector of an NimesN sparse random symmetric matrix with an average of d non-zero centered entries per row. We resample k randomly chosen entries of the matrix and obtain another realization of the random matrix with top eigenvector v[k]. Building on recent results on sparse random matrices and a noise sensitivity analysis previously developed for Wigner matrices, we prove that, if dgeqN2/9, with high probability, when kllN5/3, the vectors v and v[k] are almost collinear and, on the contrary, when kggN5/3, the vectors v and v[k] are almost orthogonal. A similar result holds for the eigenvector associated to the second largest eigenvalue of the adjacency matrix of an ErdH{o}s-R'enyi random graph with average degree dgeqN2/9.


Full work available at URL: https://arxiv.org/abs/2106.09570




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Noise sensitivity for the top eigenvector of a sparse random matrix

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