Abbe, E., Bandeira, A. S. and Hall, G. (2016). Exact recovery in the stochastic block model. IEEE Trans. Inf. Theory
Adamic, L. A. and Glance, N. (2005). The political blogosphere and the 2004 U.S. election: divided they blog. In Proc. LinkKDD'05, ACM, New York, pp. 36–43.
Bernstein, S. (1946). The Theory of Probabilities. Gastehizdat, Moscow.
Chaudhuri, K., Chung, F. and Tsiatas, A. (2012). Spectral clustering of graphs with general degrees in the extended planted partition model. In Proc. 25th Annual Conf. Learning Theory, pp. 35.1–35.23.
Chung, F. and Radcliffe, M. (2011). On the spectra of general random graphs. Electron. J. Combin.
Chung, F., Lu, L. and Vu, V. (2004). The spectra of random graphs with given expected degrees. Internet Math.
Coja-Oghlan, A. and Lanka, A. (2010). Finding planted partitions in random graphs with general degree distributions. SIAM J. Discrete Math.
Dasgupta, A., Hopcroft, J. E. and McSherry, F. (2004). Spectral analysis of random graphs with skewed degree distributions. In Proc. 45th Ann. IEEE Symp. Foundations Comput. Sci., IEEE, New York, pp. 602–610.
Decelle, A., Krzakala, F., Moore, C. and Zdeborová, L. (2011). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Phys. Rev. E
Feige, U. and Ofek, E. (2005). Spectral techniques applied to sparse random graphs. Random Structures Algorithms
Girvan, M. and Newman, M. E. J. (2002). Community structure in social and biological networks. Proc. Nat. Acad. Sci. USA
Hoff, P. D., Raftery, A. E. and Handcock, M. S. (2002). Latent space approaches to social network analysis. J. Amer. Statist. Assoc.
Holland, P. W., Laskey, K. B. and Leinhardt, S. (1983). Stochastic blockmodels: first steps. Social Networks
Horn, R. A. and Johnson, C. R. (1985). Matrix Analysis. Cambridge University Press.
Jin, J. (2015). Fast community detection by SCORE. Ann. Statist.
Karrer, B. and Newman, M. E. J. (2011). Stochastic blockmodels and community structure in networks. Phys. Rev. E
et al. (2013). Spectral redemption in clustering sparse networks. Proc. Nat. Acad. Sci. USA
Lei, J. and Rinaldo, A. (2015). Consistency of spectral clustering in stochastic block models. Ann. Statist.
et al. (2003). The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecol. Sociobiol.
McSherry, F. (2001). Spectral partitioning of random graphs. In Proc. 42nd IEEE Symp. Foundations Comput. Sci., IEEE, Los Alamitos, CA, pp. 529–537.
Mihail, M. and Papadimitriou, C. (2002). On the eigenvalue power law. In Randomization and Approximation Techniques in Computer Science (Lecture Notes Comput. Sci. 2483), Springer, Berlin, pp. 254–262.
Mossel, E., Neeman, J. and Sly, A. (2015). Consistency thresholds for the planted bisection model. In STOC'15—Proc. 2015 ACM Symp. Theory Comput., ACM, New York, pp. 69–75.
Newman, M. E. J. (2004). Detecting community structure in networks. Europ. Phys. J. B
Newman, M. E. J. (2010). Networks: An Introduction. Oxford University Press.
Newman, M. E. J. and Girvan, M. (2004). Finding and evaluating community structure in networks. Phys. Rev. E
Qin, T. and Rohe, K. (2013). Regularized spectral clustering under the degree-corrected stochastic blockmodel. In Advances in Neural Information Processing Systems 26, Curran Associates, Red Hook, NY, pp. 3120–3128.
Rohe, K., Chatterjee, S. and Yu, B. (2011). Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Statist.
Tomozei, D.-C. and Massoulié, L. (2014). Distributed user profiling via spectral methods. Stoch. Systems
Von Luxburg, U. (2007). A tutorial on spectral clustering. Statist. Comput.
Zachary, W. W. (1977). An information flow model for conflict and fission in small groups. J. Anthropological Res.
Zhang, X., Nadakuditi, R. and Newman, M. E. J. (2014). Spectra of random graphs with community structure and arbitrary degrees. Phys. Rev. E