Noise sensitivity of the top eigenvector of a Wigner matrix
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:GEMBUQPNrecord.jsonopen to challenge →
classification
math.PR
keywords
matrixeigenvectorwigneralmostnoisesensitivitythenwhen
read the original abstract
We investigate the noise sensitivity of the top eigenvector of a Wigner matrix in the following sense. Let $v$ be the top eigenvector of an $N\times N$ Wigner matrix. Suppose that $k$ randomly chosen entries of the matrix are resampled, resulting in another realization of the Wigner matrix with top eigenvector $v^{[k]}$. We prove that, with high probability, when $k \ll N^{5/3-o(1)}$, then $v$ and $v^{[k]}$ are almost collinear and when $k\gg N^{5/3}$, then $v^{[k]}$ is almost orthogonal to $v$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.