Fetching the paper…
Reading the bibliography…
The singular value matrix decomposition plays a ubiquitous role throughout statistics and related fields.
Hermann Weyl, Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung) , Mathematische Annalen 71
1912
Earlier work this paper cites.
Karl Rohe, Sourav Chatterjee, and Bin Yu, Spectral clustering and the high-dimensional stochastic blockmodel , The Annals of Statistics 39
1915
Earlier work this paper cites.
Chandler Davis and William Morton Kahan, The rotation of eigenvectors by a perturbation. III , SIAM Journal on Numerical Analysis 7
1970
Earlier work this paper cites.
Per-Åke Wedin, Perturbation bounds in connection with singular value decomposition , BIT Numerical Mathematics 12
1972
Earlier work this paper cites.
Paul W. Holland, Kathryn B. Laskey, and Samuel Leinhardt, Stochastic blockmodels: first steps , Social Networks 5
1983
Earlier work this paper cites.
Ian T. Jolliffe, Principal Component Analysis , Springer, 1986
1986
Earlier work this paper cites.
G. W. Stewart and Ji-guang Sun, Matrix perturbation theory , Academic Press, 1990
1990
Earlier work this paper cites.
Rajendra Bhatia, Matrix analysis, GTM , Springer-Verlag, New York, 1997
1997
Earlier work this paper cites.
Alan Edelman, Tomás A. Arias, and Steven T. Smith, The geometry of algorithms with orthogonality constraints , SIAM Journal on Matrix Analysis and Applications 20
1998
Earlier work this paper cites.
Adam W. Bojanczyk and Adam Lutoborski, The Procrustes problem for orthogonal Stiefel matrices , SIAM Journal on Scientific Computing 21
1999
Earlier work this paper cites.
Iain M. Johnstone, On the distribution of the largest eigenvalue in principal components analysis , The Annals of Statistics 29
2001
Earlier work this paper cites.
John C. Gower and Garmt B. Dijksterhuis, Procrustes problems , no. 30, Oxford University Press, 2004
2004
Earlier work this paper cites.
Ulrike Von Luxburg, A tutorial on spectral clustering , Statistics and Computing 17
2007
Earlier work this paper cites.
Stephen J. Young and Edward R. Scheinerman, Random dot product graph models for social networks , International Workshop on Algorithms and Models for the Web-Graph (2007), 138–149
2007
Earlier work this paper cites.
Boaz Nadler, Finite sample approximation results for principal component analysis: a matrix perturbation approach , The Annals of Statistics 36
2008
Earlier work this paper cites.
Emmanuel J. Candès and Benjamin Recht, Exact matrix completion via convex optimization , Foundations of Computational Mathematics 9
2009
Earlier work this paper cites.
Ian L. Dryden, Alexey Koloydenko, and Diwei Zhou, Non-Euclidean statistics for covariance matrices with applications to diffusion tensor imaging , The Annals of Applied Statistics 3
2009
Earlier work this paper cites.
Zhidong Bai and Jack W. Silverstein, Spectral analysis of large dimensional random matrices , vol. 20, Springer, 2010
2010
Earlier work this paper cites.
Florent Benaych-Georges and Raj Rao Nadakuditi, The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices , Advances in Mathematics 227
2011
Earlier work this paper cites.
Yasuko Chikuse, Statistics on special manifolds , vol. 174, Springer Science & Business Media, 2012
2012
Earlier work this paper cites.
Yonina C. Eldar and Gitta Kutyniok, Compressed sensing: theory and applications , Cambridge University Press, 2012
2012
Cited alongside, same era.
Roger A. Horn and Charles R. Johnson, Matrix analysis , Cambridge University Press, 2012
2012
Cited alongside, same era.
Daniel L. Sussman, Minh Tang, Donniell E. Fishkind, and Carey E. Priebe, A consistent adjacency spectral embedding for stochastic blockmodel graphs , Journal of the American Statistical Association 107
2012
Cited alongside, same era.
T. Tony Cai, Zongming Ma, and Yihong Wu, Sparse PCA: optimal rates and adaptive estimation , The Annals of Statistics 41
2013
Cited alongside, same era.
Jianqing Fan, Yuan Liao, and Martina Mincheva, Large covariance estimation by thresholding principal orthogonal complements , Journal of the Royal Statistical Society: Series B (Statistical Methodology) 75
2013
Li Chen, Joshua T. Vogelstein, Vince Lyzinski, and Carey E. Priebe, A joint graph inference case study: the C. elegans chemical and electrical connectomes , Worm 5
2016
Later among the works it cites.
Ian L. Dryden and Kanti V. Mardia, Statistical shape analysis with applications in R , John Wiley & Sons, 2016
2016
Later among the works it cites.
Can M. Le, Elizaveta Levina, and Roman Vershynin, Optimization via low-rank approximation for community detection in networks , The Annals of Statistics 44
2016
Later among the works it cites.
Sean O’Rourke, Van Vu, and Ke Wang, Eigenvectors of random matrices: a survey , Journal of Combinatorial Theory, Series A 144
2016
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.
Donniell E. Fishkind, Daniel L. Sussman, Minh Tang, Joshua T. Vogelstein, and Carey E. Priebe, Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown , SIAM Journal on Matrix Analysis and Applications 34
2013
Cited alongside, same era.
Linyuan Lu and Xing Peng, Spectra of edge-independent random graphs , The Electronic Journal of Combinatorics 20
2013
Cited alongside, same era.
Carey E. Priebe, David J. Marchette, Zhiliang Ma, and Sancar Adali, Manifold matching: joint optimization of fidelity and commensurability , Brazilian Journal of Probability and Statistics 27
2013
Cited alongside, same era.
Vince Lyzinski, Daniel L. Sussman, Minh Tang, Avanti Athreya, and Carey E. Priebe, Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding , Electronic Journal of Statistics 8
2014
Cited alongside, same era.
Debashis Paul and Alexander Aue, Random matrix theory in statistics: a review , Journal of Statistical Planning and Inference 150
2014
Cited alongside, same era.
Daniel L. Sussman, Minh Tang, and Carey E. Priebe, Consistent latent position estimation and vertex classification for random dot product graphs , IEEE Transactions on Pattern Analysis and Machine Intelligence 36
2014
Cited alongside, same era.
Minh Tang, Avanti Athreya, Daniel L. Sussman, Vince Lyzinski, and Carey E. Priebe, A nonparametric two-sample hypothesis testing problem for random dot product graphs , Bernoulli 23
2014
Cited alongside, same era.
2017
Closest in time.
Vladimir Koltchinskii and Karim Lounici, Concentration inequalities and moment bounds for sample covariance operators , Bernoulli 23
2017
Closest in time.
2017
Closest in time.
Vince Lyzinski, Youngser Park, Carey E. Priebe, and Michael W. Trosset, Fast embedding for JOFC using the raw stress criterion , Journal of Computational and Graphical Statistics 26
2017
Closest in time.
2017
Closest in time.
Minh Tang, Avanti Athreya, Daniel L. Sussman, Vince Lyzinski, Youngser Park, and Carey E. Priebe, A semiparametric two-sample hypothesis testing problem for random graphs , Journal of Computational and Graphical Statistics 26
2017
Closest in time.
2017
Closest in time.
T. Tony Cai and Anru Zhang, Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics , The Annals of Statistics 46
2018
Closest in time.
2018
Closest in time.
Justin Eldridge, Mikhail Belkin, and Yusu Wang, Unperturbed: spectral analysis beyond Davis-Kahan , Proceedings of Algorithmic Learning Theory, Proceedings of Machine Learning Research, vol. 83, PMLR, 2018, pp. 321–358
2018
Closest in time.
Jianqing Fan, Weichen Wang, and Yiqiao Zhong, An ℓ ∞ \ell_{\infty} eigenvector perturbation bound and its application to robust covariance estimation , Journal of Machine Learning Research 18
2018
Closest in time.
Vince Lyzinski, Information recovery in shuffled graphs via graph matching , IEEE Transactions on Information Theory 46
2018
Closest in time.
Elizaveta Rebrova and Roman Vershynin, Norms of random matrices: local and global problems , Advances in Mathematics 324
2018
Closest in time.
Minh Tang and Carey E. Priebe, Limit theorems for eigenvectors of the normalized Laplacian for random graphs , The Annals of Statistics 46
2018
Closest in time.
Roman Vershynin, High-dimensional probability: an introduction with applications in data science , online version 2018-02-09 (2018)
2018
Closest in time.