Fetching the paper…
Reading the bibliography…
We present an adaptation of the Kato--Temple inequality for bounding perturbations of eigenvalues with applications to statistical inference for random graphs, specifically hypothesis testing and change-point detection.
Tosio Kato, On the upper and lower bounds of eigenvalues , Physical Review Letters 77
1950
Earlier work this paper cites.
Paul Erdős and Alfréd Rényi, On random graphs , Publicationes Mathematicae (Debrecen) 6
1959
Earlier work this paper cites.
Evans M. Harrell II, Generalizations of Temple’s inequality , Proceedings of the American Mathematical Society 69
1978
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.
Fan R.K. Chung, Spectral graph theory , vol. 92, American Mathematical Soc., 1997
1997
Earlier work this paper cites.
Noga Alon, Michael Krivelevich, and Van Vu, On the concentration of eigenvalues of random symmetric matrices , Israel Journal of Mathematics 131
2002
Earlier work this paper cites.
Peter D. Hoff, Adrian E. Raftery, and Mark S. Handcock, Latent space approaches to social network analysis , Journal of the American Statistical Association 97
2002
Earlier work this paper cites.
Mark EJ Newman and Michelle Girvan, Finding and evaluating community structure in networks , Physical review E 69
2004
Earlier work this paper cites.
C. E. Priebe, J. M. Conroy, D. J. Marchette, and Y. Park, Scan statistics on Enron graphs , Computational and Mathematical Organization Theory 11
2005
Earlier work this paper cites.
Mark EJ Newman, Modularity and community structure in networks , Proceedings of the national academy of sciences 103
2006
Earlier work this paper cites.
Béla Bollobás, Svante Janson, and Oliver Riordan, The phase transition in inhomogeneous random graphs , Random Structures and Algorithms 31
2007
Earlier work this paper cites.
Ulrike Von Luxburg, A tutorial on spectral clustering , Statistics and Computing 17
2007
Earlier work this paper cites.
Stephen Young and Edward Scheinerman, Random dot product graph models for social networks , Algorithms and Models for the Web-Graph (2007), 138–149
2007
Earlier work this paper cites.
Peter J. Bickel and Aiyou Chen, A nonparametric view of network models and newman–girvan and other modularities , Proceedings of the National Academy of Sciences 106
2009
Earlier work this paper cites.
Eric D. Kolaczyk, Statistical analysis of network data , Springer Series in Statistics, Springer, New York, 2009
2009
Cited alongside, same era.
Andrey Rukhin, Asymptotic analysis of various statistics for random graph inference , ProQuest Dissertations and Theses (2009)
2009
Cited alongside, same era.
Santo Fortunato, Community detection in graphs , Physics reports 486
2010
Cited alongside, same era.
Anna Goldenberg, Alice X. Zheng, Stephen E. Fienberg, and Edoardo M. Airoldi, A survey of statistical network models , Foundations and Trends in Machine Learning 2
2010
Cited alongside, same era.
2010
Cited alongside, same era.
Ery Arias-Castro and Nicolas Verzelen, Community detection in dense random networks , The Annals of Statistics 42
2014
Later among the works it cites.
Heng Wang, Minh Tang, Youngser Park, and Carey E. Priebe, Locality statistics for anomaly detection in time series of graphs , IEEE Transactions on Signal Processing 62
2014
Later among the works it cites.
Xiao Zhang, Raj Rao Nadakuditi, and M. E. J. Newman, Spectra of random graphs with community structure and arbitrary degrees , Phys. Rev. E 89
2014
Later among the works it cites.
Avanti Athreya, Carey E. Priebe, Minh Tang, Vince Lyzinski, David J. Marchette, and Daniel L. Sussman, A limit theorem for scaled eigenvectors of random dot product graphs , Sankhya A (2015), 1–18
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Brian Karrer and M. E. J. Newman, Stochastic blockmodels and community structure in networks , Phys. Rev. E 83
2011
Cited alongside, same era.
A. Rukhin and C. E. Priebe, A comparative power analysis of the maximum degree and size invariants for random graph inference , Journal of Statistical Planning and Inference 141
2011
Cited alongside, same era.
Roger A. Horn and Charles R. Johnson, Matrix analysis , Cambridge University Press, 2012
2012
Cited alongside, same era.
Yunpeng Zhao, Elizaveta Levina, and Ji Zhu, Consistency of community detection in networks under degree-corrected stochastic block models , The Annals of Statistics 40
2012
Cited alongside, same era.
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.
2013
Cited alongside, same era.
2015
Later among the works it cites.
2015
Later among the works it cites.
Jing Lei and Alessandro Rinaldo, Consistency of spectral clustering in stochastic block models , The Annals of Statistics 43
2015
Later among the works it cites.
S. Ranshous, S. Shen, D. Koutra, S. Harenberg, C. Faloutsos, and N. F. Samatova, Anomaly detection in dynamic networks: a survey , WIRES Computational Statistics 7
2015
Later among the works it cites.
Nicolas Verzelen and Ery Arias-Castro, Community detection in sparse random networks , The Annals of Applied Probability 25
2015
Later among the works it cites.
Jing Lei, A goodness-of-fit test for stochastic block models , The Annals of Statistics 44
2016
Closest in time.
2016
Closest in time.
Vince Lyzinski, Minh Tang, Avanti Athreya, Youngser Park, and Carey E. Priebe, Community detection and classification in hierarchical stochastic blockmodels , IEEE Transactions on Network Science and Engineering 4
2017
Closest in time.
Xue Ding and Tiefeng Jiang, Spectral distributions of adjacency and laplacian matrices of random graphs , The Annals of Applied Probability 20
2086
Closest in time.