Fetching the paper…
Reading the bibliography…
Community detection is a fundamental problem in network analysis, with applications in many diverse areas.
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.
Holland, Paul W.P. W., Laskey, Kathryn BlackmondK. B. andLeinhardt, SamuelS. (1983). Stochastic blockmodels: First steps. Social Networks 5 109–137
1983
Earlier work this paper cites.
Hubert, L.L. andArabie, P.P. (1985). Comparing partitions. J. Classification 2 193–218
1985
Earlier work this paper cites.
Wang, Yuchung J.Y. J. andWong, George Y.G. Y. (1987). Stochastic blockmodels for directed graphs. J. Amer. Statist. Assoc. 82 8–19
1987
Earlier work this paper cites.
Wei, Y. C.Y. C. andCheng, C. K.C. K. (1989). Toward efficient hierarchical designs by ratio cut partitioning. In Proceedings of the IEEE International Conference on Computer Aided Design 298–301. IEEE, New York
1989
Earlier work this paper cites.
Fruchterman, T. M. J.T. M. J. andReingold, E. M.E. M. (1991). Graph drawing by force-directed placement. Software: Practice and Experience 21 1129–1164
1991
Earlier work this paper cites.
Wasserman, StanleyS. andFaust, KatherineK. (1994). Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences). Cambridge Univ. Press, Cambridge
1994
Earlier work this paper cites.
Glover, F. W.F. W. andLagunas, M.M. (1997). Tabu Search. Kluwer Academic, Norwell
1997
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.
Beasley, J. E.J. E. (1998). Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report, Management School, Imperial College, London, UK
1998
Earlier work this paper cites.
Shi, J.J. andMalik, J.J. (2000). Normalized cuts and image segmentation. IEEE Trans. Pattern Analysis and Machine Intelligence 22 888–905
2000
Earlier work this paper cites.
McCulloch, Charles E.C. E. andSearle, Shayle R.S. R. (2001). Generalized, Linear, and Mixed Models. Wiley-Interscience, New York
2001
Earlier work this paper cites.
Ng, A.A., Jordan, M.M. andWeiss, Y.Y. (2001). On spectral clustering: Analysis and an algorithm. In Neural Information Processing Systems 14 (T.T. Dietterich, S.S. Becker andZ.Z. Ghahramani, eds.) 849–856. MIT Press, Cambridge
2001
Earlier work this paper cites.
Nowicki, KrzysztofK. andSnijders, Tom A. B.T. A. B. (2001). Estimation and prediction for stochastic blockstructures. J. Amer. Statist. Assoc. 96 1077–1087
2001
Earlier work this paper cites.
Adamic, L. A.L. A. andGlance, N.N. (2005). The political blogosphere and the 2004 US Election: Divided they blog. In Proceedings of the 3rd International Workshop on Link Discovery 36-43. ACM, New York
2004
Cited alongside, same era.
Newman, M. E. J.M. E. J. (2004). Detecting community structure in networks. Eur. Phys. J. B 38 321–330
2004
Cited alongside, same era.
Newman, M. E. J.M. E. J. andGirvan, M.M. (2004). Finding and evaluating community structure in networks. Phys. Rev. E 69 026113
2004
Cited alongside, same era.
Getoor, L.L. andDiehl, C. P.C. P. (2005). Link mining: A survey. ACM SIGKDD Explorations Newsletter 7 3–12
2005
Cited alongside, same era.
Csardi, GaborG. andNepusz, TamasT. (2006). The igraph software package for complex network research. InterJournal Complex Systems 1695
2006
Cited alongside, same era.
Fortunato, SantoS. (2010). Community detection in graphs. Phys. Rep. 486 75–174
2010
Later among the works it cites.
Goldenberg, A.A., Zheng, A. X.A. X., Fienberg, S. E.S. E. andAiroldi, E. M.E. M. (2010). A survey of statistical network models. Foundations and Trends in Machine Learning 2 129–233
2010
Later among the works it cites.
Newman, M. E. J.M. E. J. (2010). Networks: An Introduction. Oxford Univ. Press, Oxford
2010
Later among the works it cites.
Airoldi, E. M.E. M. andChoi, D.D. (2011). Summary of proof in “A nonparametric view of network models and Newman–Girvan and other modularities.” Personal communication
2011
Closest in time.
Karrer, BrianB. andNewman, M. E. J.M. E. J. (2011). Stochastic blockmodels and community structure in networks. Phys. Rev. E (3) 83 016107
2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Newman, M. E. J.M. E. J. (2006). Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 103 8577–8582
2006
Cited alongside, same era.
Newman, M. E. J.M. E. J. (2006). Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E (3) 74 036104, 19
2006
Cited alongside, same era.
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.
Hoff, P. D.P. D. (2007). Modeling homophily and stochastic equivalence in symmetric relational data. In Advances in Neural Information Processing Systems, 19 MIT Press, Cambridge, MA
2007
Cited alongside, same era.
Newman, M. E. J.M. E. J. andLeicht, E. A.E. A. (2007). Mixture models and exploratory analysis in networks. Proc. Natl. Acad. Sci. USA 104 9564–9569
2007
Cited alongside, same era.
Robins, G.G., Snijders, T.T., Wang, P.P., Handcock, M.M. andPattison, P.P. (2007). Recent developments in exponential random graphs models ( p ∗ p^{*} ) for social networks. Social Networks 29 192–215
2007
Cited alongside, same era.
Schlitt, T.T. andBrazma, A.A. (2007). Current approaches to gene regulatory network modelling. BMC Bioinformatics 8 S9. Suppl 6
2007
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
Closest in time.
Bickel, P. J.P. J. andChen, A.A. (2012). Weak consistency of community detection criteria under the stochastic block model. Unpublished manuscript
2012
Closest in time.
Choi, D. S.D. S., Wolfe, P. J.P. J. andAiroldi, E. M.E. M. (2012). Stochastic blockmodels with growing number of classes. Biometrika 99 273–284
2012
Closest in time.
Decelle, A.A., Krzakala, F.F., Moore, C.C. andZdeborová, L.L. (2012). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Phys. Rev. E 84 066106
2012
Closest in time.
Perry, P. O.P. O. andWolfe, P. J.P. J. (2012). Null models for network data. Available at arXiv: \arxivurl
2012
Closest in time.
Zhang, S.S. andZhao, H.H. (2012). Community identification in networks with unbalanced structure. Phys. Rev. E 85 066114
2012
Closest in time.
Zhao, Y.Y., Levina, E.E. andZhu, J.J. (2012). Supplement to “Consistency of community detection in networks under degree-corrected stochastic block models.” DOI: \doiurl
2012
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.