Fetching the paper…
Reading the bibliography…
Suppose two networks are observed for the same set of nodes, where each network is assumed to be generated from a weighted stochastic block model.
[author] Rohe, KarlK., Chatterjee, SouravS., Yu, BinB. et al. (2011). Spectral clustering and the high-dimensional stochastic blockmodel. The Annals of Statistics 39 1878–1915. \endbibitem
1915
Earlier work this paper cites.
[author] Davis, ChandlerC. and Kahan, William MortonW. M. (1970). The rotation of eigenvectors by a perturbation. III. SIAM Journal on Numerical Analysis 7 1–46. \endbibitem
1970
Earlier work this paper cites.
[author] Holland, Paul WP. W., Laskey, Kathryn BlackmondK. B. and Leinhardt, SamuelS. (1983). Stochastic blockmodels: First steps. Social networks 5 109–137. \endbibitem
1983
Earlier work this paper cites.
[author] Stewart, Gilbert WG. W. and Sun, Ji-GuangJ.-G. (1990). Matrix Perturbation Theory (Computer Science and Scientific Computing). \endbibitem
1990
Earlier work this paper cites.
{binproceedings}
2001
Earlier work this paper cites.
[author] Feige, UrielU. and Ofek, EranE. (2005). Spectral techniques applied to sparse random graphs. Random Structures & Algorithms 27 251–275. \endbibitem
2005
Earlier work this paper cites.
[author] Anderson, Greg WG. W. and Zeitouni, OferO. (2006). A CLT for a band matrix model. Probability Theory and Related Fields 134 283–338. \endbibitem
2006
Earlier work this paper cites.
[author] Banerjee, OnureenaO., Ghaoui, Laurent ElL. E. and d’Aspremont, AlexandreA. (2008). Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data. Journal of Machine learning research 9 485–516. \endbibitem
2008
Earlier work this paper cites.
[author] Von Luxburg, UlrikeU., Belkin, MikhailM. and Bousquet, OlivierO. (2008). Consistency of spectral clustering. The Annals of Statistics 555–586. \endbibitem
2008
Earlier work this paper cites.
[author] Ahmadi, Amir AliA. A. (2009). ORF 523: lecture 2: Convex and Conic Optimization. http://www.princeton.edu/~amirali/Public/Teaching/ORF523/S16/ORF523_S16_Lec2_gh.pdf . \endbibitem
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
[author] Anderson, Greg WG. W., Guionnet, AliceA. and Zeitouni, OferO. (2010). An introduction to random matrices, volume 118 of Cambridge Studies in Advanced Mathematics. \endbibitem
2010
Earlier work this paper cites.
[author] Durrett, RickR. (2010). Probability: theory and examples. Cambridge university press. \endbibitem
2010
Earlier work this paper cites.
[author] Karrer, BrianB. and Newman, Mark EJM. E. (2011). Stochastic blockmodels and community structure in networks. Physical review E 83 016107. \endbibitem
2011
Earlier work this paper cites.
[author] Erdos, Laszlo and Yau, Horng-Tzer and Yin, Jun (2012). Rigidity of eigenvalues of generalized Wigner matrices. Advances in mathematics 229 1435,1515. \endbibitem
2012
Earlier work this paper cites.
[author] Mossel, ElchananE., Neeman, JoeJ. and Sly, AllanA. (2012). Reconstruction and estimation in the planted partition model. Preprint, available at. \endbibitem
2012
Cited alongside, same era.
[author] Kemp, ToddT. (2013). Math 247a: Introduction to random matrix theory. University of California, San Diego. \endbibitem
2013
Cited alongside, same era.
[author] Lu, LinyuanL. and Peng, XingX. (2013). Spectra of Edge-Independent Random Graphs. The Electronic Journal of Combinatorics 20 P27. \endbibitem
2013
Cited alongside, same era.
{binproceedings}
2013
Cited alongside, same era.
[author] Airoldi, Edoardo ME. M., Blei, David MD. M., Fienberg, Stephen ES. E. and Xing, Eric PE. P. (2008). Mixed membership stochastic blockmodels. Journal of Machine Learning Research 9 1981–2014. \endbibitem
2014
Cited alongside, same era.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
{binproceedings}
2015
Cited alongside, same era.
[author] Lei, JingJ., Rinaldo, AlessandroA. et al. (2015). Consistency of spectral clustering in stochastic block models. The Annals of Statistics 43 215–237. \endbibitem
2015
Cited alongside, same era.
[author] Sarkar, PurnamritaP., Bickel, Peter JP. J. et al. (2015). Role of normalization in spectral clustering for stochastic blockmodels. The Annals of Statistics 43 962–990. \endbibitem
2015
Cited alongside, same era.
[author] Schiebinger, GeoffreyG., Wainwright, Martin JM. J., Yu, BinB. et al. (2015). The geometry of kernelized spectral clustering. The Annals of Statistics 43 819–846. \endbibitem
2015
Cited alongside, same era.
[author] Athreya, AvantiA., Priebe, Carey EC. E., Tang, MinhM., Lyzinski, VinceV., Marchette, David JD. J. and Sussman, Daniel LD. L. (2016). A limit theorem for scaled eigenvectors of random dot product graphs. Sankhya A 78 1–18. \endbibitem
2016
Cited alongside, same era.
[author] Bickel, Peter JP. J. and Sarkar, PurnamritaP. (2016). Hypothesis testing for automated community detection in networks. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 78 253–273. \endbibitem
2016
Cited alongside, same era.
[author] Hsu, DanielD. (Accessed: 2016). Notes on matrix perturbation and Davis-Kahan sin ( Θ ) \sin(\Theta) theorem: COMS 4772. http://www.cs.columbia.edu/~djhsu/coms4772-f16/lectures/davis-kahan.pdf . \endbibitem
2016
Cited alongside, same era.
[author] Ghoshdastidar, DebarghyaD., Gutzeit, MaurilioM., Carpentier, AlexandraA. and von Luxburg, UlrikeU. (2017). Two-Sample Tests for Large Random Graphs Using Network Statistics. Proceedings of Machine Learning Research vol 65 1–24. \endbibitem
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
[author] Athreya, AvantiA., Fishkind, Donniell E.D. E., Tang, MinhM., Priebe, Carey E.C. E., Park, YoungserY., Vogelstein, Joshua T.J. T., Levin, KeithK., Lyzinski, VinceV., Qin, YichenY. and Sussman, Daniel LD. L. (2018). Statistical Inference on Random Dot Product Graphs: a Survey. Journal of Machine Learning Research 18 1-92. \endbibitem
2018
Closest in time.
[author] Banerjee, DebapratimD. et al. (2018). Contiguity and non-reconstruction results for planted partition models: the dense case. Electronic Journal of Probability 23. \endbibitem
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
{binproceedings}
2018
Closest in time.
[author] Tang, MinhM., Priebe, Carey EC. E. et al. (2018). Limit theorems for eigenvectors of the normalized laplacian for random graphs. The Annals of Statistics 46 2360–2415. \endbibitem
2018
Closest in time.
[author] Gao, ChaoC., Ma, ZongmingZ., Zhang, Anderson YA. Y. and Zhou, Harrison HH. H. (2017). Achieving optimal misclassification proportion in stochastic block models. The Journal of Machine Learning Research 18 1980–2024. \endbibitem
2024
Closest in time.