Fetching the paper…
Reading the bibliography…
Several problems in machine learning, statistics, and other fields rely on computing eigenvectors.
Rank correlation methods
Maurice George Kendall · 1948
Earlier work this paper cites.
Accelerating the orthogonal iteration for the eigenvectors of a hermitian matrix
G. W. Stewart · 1969
Earlier work this paper cites.
Algebraic connectivity of graphs
Miroslav Fiedler · 1973
Earlier work this paper cites.
Matrix nearness problems and applications
N. J. Higham · 1988
Earlier work this paper cites.
Stopping criteria for iterative solvers
Mario Arioli, Iain Duff, and Daniel Ruiz · 1992
Earlier work this paper cites.
On computing condition numbers for the nonsymmetric eigenproblem
Zhaojun Bai, James Demmel, and Alan McKenney · 1993
Earlier work this paper cites.
Stopping criteria for eigensolvers
Maria Bennani and Thierry Braconnier · 1994
Earlier work this paper cites.
Spectral graph theory
Fan RK Chung · 1997
Earlier work this paper cites.
Applied Numerical Linear Algebra
James W Demmel · 1997
Earlier work this paper cites.
Matrices, moments and quadrature ii; how to compute the norm of the error in iterative methods
G. H. Golub and G. Meurant · 1997
Earlier work this paper cites.
Arpack users’ guide: Solution of large scale eigenvalue problems with implicitly restarted arnoldi methods
RB Lehoucq, DC Sorensen, and C Yang · 1997
Earlier work this paper cites.
ARPACK users’ guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods
Richard B Lehoucq, Danny C Sorensen, and Chao Yang · 1998
Earlier work this paper cites.
The Symmetric Eigenvalue Problem
B. Parlett · 1998
Earlier work this paper cites.
Nonlinear dimensionality reduction by locally linear embedding
Sam T Roweis and Lawrence K Saul · 2000
Earlier work this paper cites.
The elements of statistical learning
Jerome Friedman, Trevor Hastie, and Robert Tibshirani · 2001
Earlier work this paper cites.
Laplacian eigenmaps and spectral techniques for embedding and clustering
Mikhail Belkin and Partha Niyogi · 2002
Earlier work this paper cites.
Graphs over time: densification laws, shrinking diameters and possible explanations
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos · 2005
Earlier work this paper cites.
Local graph partitioning using pagerank vectors
Reid Andersen, Fan Chung, and Kevin Lang · 2006
Earlier work this paper cites.
How to generate random matrices from the classical compact groups
Francesco Mezzadri · 2007
Earlier work this paper cites.
Graph clustering
Satu Elisa Schaeffer · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
Ulrike Von Luxburg · 2007
Cited alongside, same era.
Statistical properties of community structure in large social and information networks
Jure Leskovec, Kevin J Lang, Anirban Dasgupta, and Michael W Mahoney · 2008
Cited alongside, same era.
The mathematics of networks
Mark EJ Newman · 2008
Cited alongside, same era.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Cited alongside, same era.
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
N. Halko, P. G. Martinsson, and J. A. Tropp · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in python
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al · 2011
Perturbation of linear forms of singular vectors under gaussian noise
Vladimir Koltchinskii and Dong Xia · 2016
Later among the works it cites.
Spectral ranking
Sebastiano Vigna · 2016
Later among the works it cites.
Graph ranking guarantees for numerical approximations to katz centrality
Eisha Nathan, Geoffrey Sanders, James Fairbanks, Van E. Henson, and David A. Bader · 2017
Later among the works it cites.
Asymmetry Helps: Eigenvalue and Eigenvector Analyses of Asymmetrically Perturbed Low-Rank Matrices
Yuxin Chen, Chen Cheng, and Jianqing Fan · 2018
Later among the works it cites.
Simple, direct and efficient multi-way spectral clustering
Anil Damle, Victor Minden, and Lexing Ying · 2018
Later among the works it cites.
Unperturbed: spectral analysis beyond davis-kahan
Justin Eldridge, Mikhail Belkin, and Yusu Wang · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Numerical Methods for Large Eigenvalue Problems
Yousef Saad · 2011
Cited alongside, same era.
A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally
Michael W Mahoney, Lorenzo Orecchia, and Nisheeth K Vishnoi · 2012
Cited alongside, same era.
Defining and evaluating network communities based on ground-truth
Jaewon Yang and Jure Leskovec · 2012
Cited alongside, same era.
Pseudo-likelihood methods for community detection in large sparse networks
Arash A. Amini, Aiyou Chen, Peter J. Bickel, and Elizaveta Levina · 2013
Cited alongside, same era.
Matrix Computations
Gene H. Golub and Charles F. Van Loan · 2013
Cited alongside, same era.
Regularized spectral clustering under the degree-corrected stochastic blockmodel
Tai Qin and Karl Rohe · 2013
Cited alongside, same era.
Robust high dimensional factor models with applications to statistical machine learning
Jianqing Fan, Kaizheng Wang, Yiqiao Zhong, and Ziwei Zhu · 2018
Later among the works it cites.
An ℓ ∞ \ell_{\infty} eigenvector perturbation bound and its application to robust covariance estimation
Jianqing Fan, Weichen Wang, and Yiqiao Zhong · 2018
Later among the works it cites.
Graph signal processing: Overview, challenges, and applications
Antonio Ortega, Pascal Frossard, Jelena Kovačević, José MF Moura, and Pierre Vandergheynst · 2018
Later among the works it cites.
Understanding regularized spectral clustering via graph conductance
Yilin Zhang and Karl Rohe · 2018
Later among the works it cites.
Near-optimal bounds for phase synchronization
Yiqiao Zhong and Nicolas Boumal · 2018
Later among the works it cites.
Subspace Estimation from Unbalanced and Incomplete Data Matrices: ℓ 2 , ∞ \ell_{2,\infty} Statistical Guarantees
Changxiao Cai, Gen Li, Yuejie Chi, H. Vincent Poor, and Yuxin Chen · 2019
Later among the works it cites.
The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
Joshua Cape, Minh Tang, and Carey E. Priebe · 2019
Later among the works it cites.
Spectral method and regularized mle are both optimal for top- k k ranking
Yuxin Chen, Jianqing Fan, Cong Ma, and Kaizheng Wang · 2019
Later among the works it cites.
Lihua Lei · 2019
Later among the works it cites.
Gemsec: Graph embedding with self clustering
Benedek Rozemberczki, Ryan Davies, Rik Sarkar, and Charles Sutton · 2019
Later among the works it cites.
The sup-norm perturbation of hosvd and low rank tensor denoising
Dong Xia and Fan Zhou · 2019
Later among the works it cites.
Entrywise eigenvector analysis of random matrices with low expected rank
Emmanuel Abbe, Jianqing Fan, Kaizheng Wang, and Yiqiao Zhong · 2020
Closest in time.
Uniform bounds for invariant subspace perturbations
Anil Damle and Yuekai Sun · 2020
Closest in time.
Randomized numerical linear algebra: Foundations & algorithms
Per-Gunnar Martinsson and Joel Tropp · 2020
Closest in time.