Fetching the paper…
Reading the bibliography…
This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability.
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.
Hoeffding, WassilyW. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13–30
1963
Earlier work this paper cites.
White, HalbertH. (1982). Maximum likelihood estimation of misspecified models. Econometrica 50 1–25
1982
Earlier work this paper cites.
Schneider, RolfR. (1993). Convex Bodies: The Brunn–Minkowski Theory. Encyclopedia of Mathematics and Its Applications 44. Cambridge Univ. Press, Cambridge
1993
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.
Alon, NogaN., Fernandez de la Vega, W.W., Kannan, RaviR. andKarpinski, MarekM. (2003). Random sampling and approximation of MAX-CSPs. J. Comput. System Sci. 67 212–243
2003
Earlier work this paper cites.
Bousquet, O.O., Boucheron, S.S. andLugosi, G.G. (2004). Introduction to statistical learning theory. In Advanced Lectures on Machine Learning (O.O. Bousquet, U.U. von Luxburg andG.G. Rätsch, eds.) 169–207. Springer, Berlin
2004
Earlier work this paper cites.
Borgs, ChristianC., Chayes, JenniferJ., Lovász, LászlóL., Sós, Vera T.V. T., Szegedy, BalázsB. andVesztergombi, KatalinK. (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
2006
Earlier work this paper cites.
Newman, M. E. J.M. E. J. (2006). Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 103 8577–8582
2006
Earlier work this paper cites.
Fortunato, SantoS. andBarthélemy, MarcM. (2007). Resolution limit in community detection. Proc. Natl. Acad. Sci. USA 104 36–41
2007
Earlier work this paper cites.
Borgs, C.C., Chayes, J. T.J. T., Lovász, L.L., Sós, V. T.V. T. andVesztergombi, K.K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801–1851
2008
Cited alongside, same era.
Clémençon, StéphanS., Lugosi, GáborG. andVayatis, NicolasN. (2008). Ranking and empirical minimization of U U -statistics. Ann. Statist. 36 844–874
2008
Cited alongside, same era.
Diaconis, PersiP. andJanson, SvanteS. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7) 28 33–61
2008
Cited alongside, same era.
Bickel, P. J.P. J. andChen, A.A. (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.
Hoff, P. D.P. D. (2009). Multiplicative latent factor models for description and prediction of social networks. Computat. Math. Org. Theory 15 261–272
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
2012
Closest in time.
Fienberg, Stephen E.S. E. (2012). A brief history of statistical models for network analysis and open challenges. J. Comput. Graph. Statist. 21 825–839
2012
Closest in time.
2012
Closest in time.
Kim, MyunghwanM. andLeskovec, JureJ. (2012). Multiplicative attribute graph model of real-world networks. Internet Math. 8 113–160
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
Miller, K. T.K. T., Griffiths, T. L.T. L. andJordan, M. I.M. I. (2009). Nonparametric latent feature models for link prediction. In Advances in Neural Information Processing Systems 22 (Y.Y. Bengio, D.D. Schuurmans, J.J. Lafferty, C. K. I.C. K. I. Williams andA.A. Culotta, eds.) 1276–1284. MIT Press, Cambridge, MA
2009
Cited alongside, same era.
Bickel, Peter J.P. J., Chen, AiyouA. andLevina, ElizavetaE. (2011). The method of moments and degree distributions for network models. Ann. Statist. 39 2280–2301
2011
Cited alongside, same era.
Zhao, YunpengY., Levina, ElizavetaE. andZhu, JiJ. (2011). Community extraction for social networks. Proc. Natl. Acad. Sci. USA 108 7321–7326
2011
Cited alongside, same era.
Borgs, C.C., Chayes, J. T.J. T., Lovász, L.L., Sós, V. T.V. T. andVesztergombi, K.K. (2012). Convergent sequences of dense graphs. II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 151–219
2012
Cited alongside, same era.
Closest in time.
2012
Closest in time.
2012
Closest in time.
Fishkind, Donniell E.D. E., Sussman, Daniel L.D. L., Tang, MinhM., Vogelstein, Joshua T.J. T. andPriebe, Carey E.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
2013
Closest in time.
Airoldi, E. M.E. M., Blei, D. M.D. M., Fienberg, S. E.S. E. andXing, E. P.E. P. (2008). Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9 1981–2014
2014
Closest in time.