Co-clustering separately exchangeable network data

Annals of Statistics

Volumn 42, Issue 1, 2014, Pages 29-63

  Choi, David ^a   Wolfe, Patrick J ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Bipartite graph; Network clustering; Oracle inequality; Profile likelihood; Statistical network analysis; Stochastic blockmodel and co blockmodel

Indexed keywords

EID: 84893676824     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/13-AOS1173     Document Type: Article

References (28)

1. Airoldi, E. M., Blei, D. M., Fienberg, S. E. And Xing, E. P. (2008). Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9 1981-2014.
2. Alon, N., Fernandez De La Vega, W., Kannan, R. And Karpinski, M. (2003). Random sampling and approximation of MAX-CSPs. J. Comput. System Sci. 67 212-243. MR2022830
3. Bickel, P. J. And Chen, A. (2009). A nonparametric view of network models and Newman-Girvan and other modularities. Proc. Natl. Acad. Sci. USA 106 21068-21073.
4. Bickel, P. J., Chen, A. And Levina, E. (2011). The method of moments and degree distributions for network models. Ann. Statist. 39 2280-2301. MR2906868
5. Borgs, C., Chayes, J., LováSz, L., SóS, V. T., Szegedy, B. And Vesztergombi, K. (2006). Graph limits and parameter testing. In STOC' 06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing 261-270. ACM, New York. MR2277152
6. Borgs, C., Chayes, J. T., LováSz, L., SóS, V. T. And Vesztergombi, K. (2008). Convergent sequences of dense graphs. In Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801-1851. MR2455626
7. Borgs, C., Chayes, J. T., LováSz, L., SóS, V. T. And Vesztergombi, K. (2012). Convergent sequences of dense graphs. II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 151-219. MR2925382
8. Bousquet, O., Boucheron, S. And Lugosi, G. (2004). Introduction to statistical learning theory. In Advanced Lectures on Machine Learning (O. Bousquet, U. von Luxburg and G. Rätsch, eds.) 169-207. Springer, Berlin.
9. Chatterjee, S. (2012). Matrix estimation by universal singular value thresholding. Preprint. Available at arXiv:1212.1247.
10. Choi, D. S., Wolfe, P. J. And Airoldi, E. M. (2012). Stochastic blockmodels with a growing number of classes. Biometrika 99 273-284. MR2931253
11. CléMençOn, S., Lugosi, G. And Vayatis, N. (2008). Ranking and empirical minimization of U-statistics. Ann. Statist. 36 844-874. MR2396817
12. Diaconis, P. And Janson, S. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7) 28 33-61. MR2463439
13. Fienberg, S. E. (2012). A brief history of statistical models for network analysis and open challenges. J. Comput. Graph. Statist. 21 825-839. MR3005799
14. Fishkind, D. E., Sussman, D. L., Tang, M., Vogelstein, J. T. And Priebe, C. E. (2013). Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown. SIAM J. Matrix Anal. Appl. 34 23-39. MR3032990
15. Flynn, C. J. And Perry, P. O. (2012). Consistent biclustering. Preprint. Available at arXiv:1206-6927.
16. Fortunato, S. And BarthéLemy, M. (2007). Resolution limit in community detection. Proc. Natl. Acad. Sci. USA 104 36-41.
17. Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13-30. MR0144363
18. Hoff, P. D. (2009). Multiplicative latent factor models for description and prediction of social networks. Computat. Math. Org. Theory 15 261-272.
19. Hoff, P. D., Raftery, A. E. And Handcock, M. S. (2002). Latent space approaches to social network analysis. J. Amer. Statist. Assoc. 97 1090-1098. MR1951262
20. Kim, M. And Leskovec, J. (2012). Multiplicative attribute graph model of real-world networks. Internet Math. 8 113-160. MR2900491
21. Miller, K. T., Griffiths, T. L. And Jordan, M. I. (2009). Nonparametric latent feature models for link prediction. In Advances in Neural Information Processing Systems 22 (Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams and A. Culotta, eds.) 1276-1284. MIT Press, Cambridge, MA.
22. Newman, M. E. J. (2006). Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 103 8577-8582.
23. Rohe, K., Chatterjee, S. And Yu, B. (2011). Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Statist. 39 1878-1915. MR2893856
24. Rohe, K. And Yu, B. (2012). Co-clustering for directed graphs: The stochastic co-blockmodel and a spectral algorithm. Preprint. Available at arXiv:1204.2296.
25. Schneider, R. (1993). Convex Bodies: The Brunn-Minkowski Theory. Encyclopedia of Mathematics and Its Applications 44. Cambridge Univ. Press, Cambridge. MR1216521
26. White, H. (1982). Maximum likelihood estimation of misspecified models. Econometrica 50 1-25. MR0640163
27. Zhao, Y., Levina, E. And Zhu, J. (2011). Community extraction for social networks. Proc. Natl. Acad. Sci. USA 108 7321-7326.
28. Zhao, Y., Levina, E. And Zhu, J. (2012). Consistency of community detection in networks under degree-corrected stochastic block models. Ann. Statist. 40 2266-2292. MR3059083