Noise sensitivity for the top eigenvector of a sparse random matrix - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Journal of Probability Année : 2022

Noise sensitivity for the top eigenvector of a sparse random matrix

Jaehun Lee
  • Fonction : Auteur

Résumé

We investigate the noise sensitivity of the top eigenvector of a sparse random symmetric matrix. Let $v$ be the top eigenvector of an $N\times N$ 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 $d\geq N^{2/9}$, with high probability, when $k \ll N^{5/3}$, the vectors $v$ and $v^{[k]}$ are almost collinear and, on the contrary, when $k\gg N^{5/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 Erd\H{o}s-R\'enyi random graph with average degree $d \geq N^{2/9}$.

Dates et versions

hal-03447814 , version 1 (24-11-2021)

Identifiants

Citer

Charles Bordenave, Jaehun Lee. Noise sensitivity for the top eigenvector of a sparse random matrix. Electronic Journal of Probability, 2022, 27, pp.49. ⟨hal-03447814⟩
16 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More