Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown

SIAM Journal on Matrix Analysis and Applications

Volumn 34, Issue 1, 2012, Pages 23-39

  Fishkind, Donniell E ^a   Sussman, Daniel L ^a   Tang, Minh ^a   Vogelstein, Joshua T ^a   Priebe, Carey E ^a  

^a Johns Hopkins University   (United States)

Author keywords

Adjacency matrix; Spectral partition; Stochastic block model

Indexed keywords

ADJACENCY MATRICES; COMMUNICATION PROBABILITIES; MULTIPLE MODALITIES; NORMALIZED LAPLACIAN; PERFORMANCE PENALTIES; SPECTRAL PARTITIONING; SPECTRAL TECHNIQUES; STOCHASTIC BLOCK MODELS;

COMMUNICATION; DIRECTED GRAPHS; STOCHASTIC SYSTEMS;

STOCHASTIC MODELS;

EID: 84877319528     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/120875600     Document Type: Article

References (27)

1. P. J. Bickel and A. Chen, A nonparametric view of network models and Newman-Girvan and other modularities, in Proc. Natl. Acad. Sci. USA, 106 (2009), pp. 21068-21073.
2. P. J. Bickel, A. Chen, and E. Levina, The method of moments and degree distributions for network models, Ann. Statist., 39 (2011), pp. 2280-2301.
3. K. Chaudhuri, F. Chung, and A. Tsiatas, Spectral clustering of graphs with general degrees in the extended planted partition model, J. Machine Learning Research: Workshop and Conference Proceedings, 23 (2012), pp. 1-23.
4. D. S. Choi, P. J. Wolfe, and E. M. Airoldi, Stochastic blockmodels with growing number of classes, Biometrika, 99 (2012), pp. 273-284.
5. F. Chung, L. Lu, and V. Vu, The spectra of random graphs with given expected degrees, Internet Math., 1 (2004), pp. 257-275.
6. A. Coja-Oghlan, Graph partitioning via adaptive spectral techniques, Combin. Probab. Comput., 19 (2010), pp. 227-284.
7. A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model, Random Structures Algorithms, 18 (2001), pp. 116-140.
8. C. Davis and W. M. Kahan, The rotation of eigenvectors by a perturbation. III, SIAM J. Numer. Anal., 7 (1970), pp. 1-46.
9. P. Fjallstrom, Algorithms for graph partitioning: A survey, Computer and Information Science, 3 (1998), article 10.
10. S. Fortunato, Community detection in graphs, Phys. Rep., 486 (2010), pp. 75-174.
11. P. Hoff, A. Rafferty, and M. Handcock, Latent space approaches to social network analysis, J. Amer. Statist. Assoc., 97 (2002), pp. 1090-1098.
12. P. W. Holland, K. B. Laskey, and S. Lienhardt, Stochastic blockmodels: First steps, Social Networks, 5 (1983), pp. 109-137.
13. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
14. T. C. Hu, F. Moricz, and R. L. Taylor, Strong laws of large numbers for arrays of rowwise independent random variables, Acta Math. Hungar., 54 (1989), pp. 153-162.
15. B. Karrer and M. E. J. Newman, Stochastic blockmodels and community structure in networks, Phys. Rev. E. (3), 83 (2011), 016107.
16. 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.
17. F. McSherry, Spectral partitioning of random graphs, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 529-537.
18. M. Newman and M. Girvan, Finding and evaluating community structure in networks, Phys. Rev. E (3), 69 (2004), 026113.
19. R. I. Oliveira, Concentration of the Adjacency Matrix and of the Laplacian in Random Graphs with Independent Edges, preprint, ArXiv:0911.0600, 2010.
20. K. Rohe, S. Chatterjee, and B. Yu, Spectral clustering and the high-dimensional stochastic blockmodel, Ann. Statist., 39 (2011), pp. 1878-1915.
21. K. Rohe and B. Yu, Co-clustering for Directed Graphs; the Stochastic Co-blockmodel and a Spectral Algorithm, preprint, ArXiv:1204.2296, 2012.
22. E. R. Scheinerman and K. Tucker, Modeling graphs using dot product representations, Comput. Statist., 25 (2010), pp. 1-6.
23. T. Snijders and K. Nowicki, Estimation and prediction for stochastic blockmodels for graphs with latent block structure, J. Classification, 14 (1997), pp. 75-100.
24. D. Sussman, M. Tang, D. E. Fishkind, and C. E. Priebe, A consistent adjacency spectral embedding for stochastic blockmodel graphs, submitted; available online from http://arxiv.org/ abs/1108.2228
25. Y. J. Wang and G. Y. Wong, Stochastic blockmodels for directed graphs, J. Amer. Statist. Assoc., 82 (1987), pp. 8-19.
26. S. Young and E. Scheinerman, Random dot product models for social networks, in Proceedings of the 5th International Conference on Algorithms and Models for the Web-graph, Lecture Notes in Comput. Sci. 4863, Springer, Berlin, 2007, pp. 138-149.
27. F. Zhang and Q. Zhang, Eigenvalue inequalities for matrix product, IEEE Trans. Automat. Control, 51 (2006), pp. 1506-1509.