Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels

Rohe, KarlK., Chatterjee, SouravS. andYu, BinB. (2011). Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Statist. 39 1878–1915

1915

Earlier work this paper cites.

Le Cam, LucienL. andYang, Grace L.G. L. (1988). On the preservation of local asymptotic normality under information loss. Ann. Statist. 16 483–520

1988

Earlier work this paper cites.

Snijders, Tom A. B.T. A. B. andNowicki, KrzysztofK. (1997). Estimation and prediction for stochastic blockmodels for graphs with latent block structure. J. Classification 14 75–100

1997

Earlier work this paper cites.

Van der Vaart, Aad WA. W. (2000). Asymptotic Statistics 3. Cambridge Univ. Press, Cambridge

2000

Earlier work this paper cites.

Hoff, Peter D.P. D., Raftery, Adrian E.A. E. andHandcock, Mark S.M. S. (2002). Latent space approaches to social network analysis. J. Amer. Statist. Assoc. 97 1090–1098

2002

Earlier work this paper cites.

Lehmann, E. L.E. L. andRomano, Joseph P.J. P. (2005). Testing Statistical Hypotheses, 3rd ed. Springer, New York

2005

Earlier work this paper cites.

Proulx, S. R.S. R., Promislow, D. E. L.D. E. L. andPhillips, P. C.P. C. (2005). Network thinking in ecology and evolution. Trends in Ecology & Evolution 20 345–353

2005

Earlier work this paper cites.

Bollobás, BélaB., Janson, SvanteS. andRiordan, OliverO. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3–122

2007

Earlier work this paper cites.

Handcock, Mark S.M. S., Raftery, Adrian E.A. E. andTantrum, Jeremy M.J. M. (2007). Model-based clustering for social networks. J. Roy. Statist. Soc. Ser. A 170 301–354

2007

Cited alongside, same era.

Coja-Oghlan, AminA. andLanka, AndréA. (2008). Partitioning random graphs with general degree distributions. In Fifth IFIP International Conference on Theoretical Computer Science—TCS 2008. IFIP Int. Fed. Inf. Process. 273 127–141. Springer, New York

2008

Cited alongside, same era.

Daudin, J. J.J. J., Picard, F.F. andRobin, S.S. (2008). A mixture model for random graphs. Stat. Comput. 18 173–183

2008

Cited alongside, same era.

Bickel, Peter J.P. J. andChen, AiyouA. (2009). A nonparametric view of network models and Newman–Girvan and other modularities. Proc. Natl. Acad. Sci. USA 106 21068–21073

2009

Cited alongside, same era.

Karrer, BrianB. andNewman, M. E. J.M. E. J. (2011). Stochastic blockmodels and community structure in networks. Phys. Rev. E (3) 83 016107, 10

2011

Later among the works it cites.

Latouche, PierreP., Birmelé, EtienneE. andAmbroise, ChristopheC. (2011). Overlapping stochastic block models with application to the French political blogosphere. Ann. Appl. Stat. 5 309–336

2011

Later among the works it cites.

Chatterjee, S.S. (2012). Matrix estimation by universal singular value thresholding. Preprint. Available at \arxivurl

Original

2012

Closest in time.

Chaudhuri, K.K., Chung, F.F. andTsiatas, A.A. (2012). Spectral clustering of graphs with general degrees in the extended planted partition model. J. Mach. Learn. Res. 23 1–23

2012

Closest in time.

Choi, D. S.D. S., Wolfe, P. J.P. J. andAiroldi, E. M.E. M. (2012). Stochastic blockmodels with a growing number of classes. Biometrika 99 273–284