Fetching the paper…
Reading the bibliography…
For random graphs distributed according to a stochastic block model, we consider the inferential task of partioning vertices into blocks using spectral techniques.
K. Rohe, S. Chatterjee, and B. Yu, Spectral clustering and the high-dimensional stochastic blockmodel, The Annals of Statistics 39
1915
Earlier work this paper cites.
C. Davis and W.M. Kahan, The rotation of eigenvectors by a perturbation III, SIAM J. Numer. Anal. 7
1970
Earlier work this paper cites.
P.W. Holland, K. Laskey, and S. Lienhardt, Stochastic blockmodels: First steps, Social Networks 5
1983
Earlier work this paper cites.
R.A. Horn, C.R. Johnson, Matrix Analysis , Cambridge University Press, (1985)
1985
Earlier work this paper cites.
Y.J. Wang and G.Y. Wong, Stochastic blockmodels for directed graphs, Journal of the American Statistical Association 82
1987
Earlier work this paper cites.
T.C. Hu, F. Moricz, and R.L. Taylor, Strong laws of large numbers for arrays of rowwise independent random variables, Acta Math. Hung 54
1989
Earlier work this paper cites.
T. Snijders and K. Nowicki, Estimation and prediction for stochastic block models for graphs with latent block structure, Journal of Classification 14
1997
Earlier work this paper cites.
P. Fjallstrom, Algorithms for Graph Partitioning: A Survey, Computer and Information Science
1998
Earlier work this paper cites.
A. Condon and R.M. Karp, Algorithms for graph partitioning on the planted partition model, Random Structures and Algorithms 18
2001
Earlier work this paper cites.
F. McSherry, Spectral partitioning of random graphs, 42nd IEEE Symposium on Foundations of Computer Science (2001), pages 529–537
2001
Cited alongside, same era.
P. Hoff, A. Rafferty, and M. Handcock, Latent space approaches to social network analysis. Journal of the American Statistical Association 97
2002
Cited alongside, same era.
F. Chung, L. Lu, V. Vu, The spectra of random graphs with given expected degrees, Internet Mathematics
2004
Cited alongside, same era.
M. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review 69
2004
Cited alongside, same era.
F. Zhang and Q. Zhang, Eigenvalue inequalities for matrix product, IEEE Transaction on Automatic Control 51
2006
Cited alongside, same era.
S. Fortunato, Community Detection in graphs, Physics Reports
2010
Later among the works it cites.
2010
Later among the works it cites.
E. Scheinerman and K. Tucker, Modeling graphs using dot product representations. Computational Statistics
2010
Later among the works it cites.
P.J. Bickel, A. Chen, and E. Levina, The method of moments and degree distributions for network models, The Annals of Statistics 39
2011
Later among the works it cites.
B. Karrer , M. E. J. Newman, Stochastic blockmodels and community structure in networks, Physical Review E
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Young and E. Scheinerman, Random dot product models for social networks, Proceedings of the 5th International Conference on Algorithms and Models for the Web-graph (2007), pages 138–149
2007
Cited alongside, same era.
P.J. Bickel and A. Chen, A nonparametric view of network models and Newman-Girvan and other modularities, Proceedings of the National Academy of Sciences of the United States of America 106
2009
Cited alongside, same era.
D.S. Choi, P.J. Wolfe, and E.M. Airoldi, Stochastic blockmodels with growing number of classes (2010), preprint
2010
Cited alongside, same era.
A. Coja-Oghlan, Graph partitioning via adaptive spectral techniques, Combinatorics, Probability and Computing
2010
Cited alongside, same era.
Cited in the paper.
D. J. Marchette, C. E. Priebe, and G. Coppersmith, Vertex nomination via attributed random dot product graphs, In Proceedings of the 57th ISI World Statistics Congress
2011
Later among the works it cites.
K. Chaudhuri, F. Chung, A. Tsiatas, Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model, Journal of Machine Learning Research: Workshop and Conference Proceedings
2012
Closest in time.