Abstract
Summary Estimating eigenvectors and low-dimensional subspaces is of central importance for numerous problems in statistics, computer science and applied mathematics. In this paper we characterize the behaviour of perturbed eigenvectors for a range of signal-plus-noise matrix models encountered instatistical and random-matrix-theoretic settings. We establish both first-order approximation results, i.e., sharp deviations, and second-order distributional limit theory, i.e., fluctuations. The concise methodology presented in this paper synthesizes tools rooted in two core concepts, namely deterministic decompositions of matrix perturbations and probabilistic matrix concentration phenomena. We illustrate our theoretical results with simulation examples involving stochastic block model random graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
