Fetching the paper…
Reading the bibliography…
We establish asymptotic normality results for estimation of the block probability matrix $\mathbf{B}$ in stochastic blockmodel graphs using spectral embedding when the average degrees grows at the rate of $\omega(\sqrt{n})$ in $n$, the number of vertices.
The rotation of eigenvectors by a pertubation. III
C. Davis and W. Kahan · 1970
Earlier work this paper cites.
The eigenvalues of random symmetric matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
Stochastic blockmodels: first steps
P. W Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Matrix pertubation theory
G. W. Stewart and J. Sun · 1990
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1997
Earlier work this paper cites.
Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure
T. A. B. Snijders and K. Nowicki · 1997
Earlier work this paper cites.
Theory of Point Estimation
E. L. Lehmann and G. Casella · 1998
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
Latent space approaches to social network analysis
P. D. Hoff, A. E. Raftery, and M. S. Handcock · 2002
Earlier work this paper cites.
Concentration inequalities using the entropy method
S. Boucheron, G. Lugosi, and P. Massart · 2003
Earlier work this paper cites.
Finding and evaluating community structure in networks
M. Newman and M. Girvan · 2004
Earlier work this paper cites.
Computing communities in large networks using random walks
P. Pons and M. Latapy · 2005
Earlier work this paper cites.
A tutorial on spectral clustering
U. Von Luxburg · 2007
Earlier work this paper cites.
Random dot product graph models for social networks
S. Young and E. Scheinerman · 2007
Earlier work this paper cites.
Mixed membership stochastic blockmodels
E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing · 2008
Earlier work this paper cites.
A mixture model for random graphs
J. J. Daudin, F. Picard, and S. Robin · 2008
Earlier work this paper cites.
Maps of random walks on complex networks reveal community structure
M. Rosvall and C. T. Bergstrom · 2008
Earlier work this paper cites.
A nonparametric view of network models and Newman-Girvan and other modularities
P. J. Bickel and A. Chen · 2009
Earlier work this paper cites.
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
R. I. Oliveira · 2009
Earlier work this paper cites.
Graph partitioning via adaptive spectral techniques
A. Coja-Oghlan · 2010
Cited alongside, same era.
Community detection in graphs
S. Fortunato · 2010
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
B. Karrer and M. E. J. Newman · 2011
Cited alongside, same era.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Cited alongside, same era.
Consistency of maximum-likelihood and variational estimators in the stochastic blockmodel
A. Celisse, J. J. Daudin, and L. Pierre · 2012
Cited alongside, same era.
Spectral partitioning of graphs with general degrees and the extended planted partition model
K. Chaudhuri, F. Chung, and A. Tsiatas · 2012
Cited alongside, same era.
Rate-optimal graphon estimation
C. Gao, Y. Lu, Z. Ma, and H. H. Zhou · 2015
Later among the works it cites.
Consistency of spectral clustering in stochastic blockmodels
J. Lei and A. Rinaldo · 2015
Later among the works it cites.
Exact recovery in the stochastic blockmodel
E. Abbe, A. S. Bandeira, and G. Hall · 2016
Later among the works it cites.
A limit theorem for scaled eigenvectors of random dot product graphs
A. Athreya, V. Lyzinski, D. J. Marchette, C. E. Priebe, D. L. Sussman, and M. Tang · 2016
Later among the works it cites.
Acheiving exact cluster recovery threshold via semidefinite programming
B. Hajek, Y. Wu, and J. Xu · 2016
Later among the works it cites.
Impact of regularization on spectral clustering
A. Joseph and B. Yu · 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…
Stochastic blockmodels with a growing number of classes
D. S. Choi, P. J. Wolfe, and E. M. Airoldi · 2012
Cited alongside, same era.
Large networks and graph limits
L. Lovász · 2012
Cited alongside, same era.
A consistent adjacency spectral embedding for stochastic blockmodel graphs
D. L. Sussman, M. Tang, D. E. Fishkind, and C. E. Priebe · 2012
Cited alongside, same era.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Cited alongside, same era.
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
E. M. Airoldi, T. B. Costa, and S. H. Chan · 2013
Cited alongside, same era.
Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
P. Bickel, D. Choi, X. Chang, and H. Zhang · 2013
Cited alongside, same era.
A goodness-of-fit test for stochastic block models
J. Lei · 2016
Later among the works it cites.
Hypothesis testing for automated community detection in networks
P. Sarkar and P. J. Bickel · 2016
Later among the works it cites.
Entrywise eigenvector analysis of random matrices with low expected rank
E. Abbe, J. Fan, K. Wang, and Y. Zhong · 2017
Closest in time.
Optimal hypothesis testing for stochastic blockmodels with growing degrees
D. Banerjee and Z. Ma · 2017
Closest in time.
J. Cape, M. Tang, and C. E. Priebe · 2017
Closest in time.
Unperturbed: spectral analysis beyond Davis-Kahan
J. Eldridge, M. Belkin, and Y. Wang · 2017
Closest in time.
Oracle inequalities for network models and sparse graphon estimation
O. Klopp, A. Tsybakov, and N. Verzelen · 2017
Closest in time.
Community detection and classification in hierarchical stochastic blockmodels
V. Lyzinski, M. Tang, A. Athreya, Y. Park, and C. E. Priebe · 2017
Closest in time.
Estimating mixed memberships with sharp eigenvector deviations
X. Mao, P. Sarkar, and D. Chakrabarti · 2017
Closest in time.
The generalised random dot product graph
P. Rubin-Delanchy, C. E. Priebe, and M. Tang · 2017
Closest in time.
A semiparametric two-sample hypothesis testing problem for random dot product graphs
M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski, Y. Park, and C. E. Priebe · 2017
Closest in time.
Rates of convergence of spectral methods for graphon estimation
J. Xu · 2017
Closest in time.