Fetching the paper…
Reading the bibliography…
Vertex clustering in a stochastic blockmodel graph has wide applicability and has been the subject of extensive research.
Strong consistency of k k -means clustering
D. Pollard · 1981
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. Laskey, and S. Leinhardt · 1983
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.
Latent space approaches to social network analysis
P. D. Hoff, A. E. Raftery, and M. S. Handcock · 2002
Earlier work this paper cites.
Modularity and community structure in networks
M. E. J. Newman · 2006
Earlier work this paper cites.
Random dot product graph models for social networks
S. Young and E. Scheinerman · 2007
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 · 2010
Earlier work this paper cites.
The method of moments and degree distributions for network models
P. J. Bickel, A. Chen, and E. Levina · 2011
Earlier work this paper cites.
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.
Freedman’s inequality for matrix martingales
J. A. Tropp · 2011
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.
Stochastic blockmodels with a growing number of classes
D. S. Choi, P. J. Wolfe, and E. M. Airoldi · 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.
Universally consistent vertex classification for latent position graphs
M. Tang, D. L. Sussman, and C. E. Priebe · 2013
Closest in time.
Nonparametric graphon estimation
P. J. Wolfe and S. C. Olhede · 2013
Closest in time.
Co-clustering separately exchangeable network data
David Choi, Patrick J Wolfe, et al · 2014
Closest in time.
Spectral clustering for divide-and-conquer graph matching
V. Lyzinski, D. L. Sussman, D. E. Fishkind, H. Pao, L. Chen, J. T. Vogelstein, and C. E. Priebe · 2014
Closest in time.
Consistency thresholds for binary symmetric block models
E. Mossel, J. Neeman, and A. Sly · 2014
Closest in time.
Consistent latent position estimation and vertex classification for random dot product graphs
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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 · 2013
Cited alongside, same era.
Consistency of spectral clustering in sparse stochastic blockmodels
J. Lei and A. Rinaldo · 2013
Cited alongside, same era.
Regularized spectral clustering under the degree-corrected stochastic blockmodel
Tai Qin and Karl Rohe · 2013
Cited alongside, same era.
Stochastic block models and reconstruction
E. Mossel, J. Neeman, and A. Sly
Cited in the paper.
D. L. Sussman, M. Tang, and C. E. Priebe · 2014
Closest in time.
Empirical bayes estimation for the stochastic blockmodel
S. Suwan, D.S Lee, R. Tang, D.L. Sussman, M. Tang, and C.E. Priebe · 2014
Closest in time.
A semiparametric two-sample hypothesis testing problem for random dot product graphs
M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski, and C. E. Priebe · 2014
Closest in time.