Fetching the paper…
Reading the bibliography…
Community detection, which aims to cluster $N$ nodes in a given graph into $r$ distinct groups based on the observed undirected edges, is an important problem in network data analysis.
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.
Bickel, PeterP., Choi, DavidD., Chang, XiangyuX. andZhang, HaiH. (2013). Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels. Ann. Statist. 41 1922–1943
1943
Earlier work this paper cites.
Chernoff, HermanH. (1981). A note on an inequality involving the normal distribution. Ann. Probab. 9 533–535
1981
Earlier work this paper cites.
Füredi, Z.Z. andKomlós, J.J. (1981). The eigenvalues of random symmetric matrices. Combinatorica 1 233–241
1981
Earlier work this paper cites.
Holland, Paul W.P. W., Laskey, Kathryn BlackmondK. B. andLeinhardt, SamuelS. (1983). Stochastic blockmodels: First steps. Soc. Netw. 5 109–137
1983
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.
McSherry, FrankF. (2001). Spectral partitioning of random graphs. In 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001) 529–537. IEEE Computer Soc., Los Alamitos, CA
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.
Ahlswede, RudolfR. andWinter, AndreasA. (2002). Strong converse for identification via quantum channels. IEEE Trans. Inform. Theory 48 569–579
2002
Earlier work this paper cites.
Adamic, A.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
Earlier work this paper cites.
Clauset, A.A., Newman, M.M. andMoore, C.C. (2004). Finding community structure in very large networks. Phys. Rev. E 70 066111
2004
Earlier work this paper cites.
Newman, M.M. andGirvan, M.M. (2004). Finding and evaluating community structure in networks. Phys. Rev. E 69 026113
2004
Earlier work this paper cites.
Giesen, JoachimJ. andMitsche, DieterD. (2005). Reconstructing many partitions using spectral techniques. In Fundamentals of Computation Theory. Lecture Notes in Computer Science 3623 433–444. Springer, Berlin
2005
Earlier work this paper cites.
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
Earlier work this paper cites.
Newman, M.M. andLeicht, E.E. (2007). Mixture models and exploratory analysis in networks. Proc. Natl. Acad. Sci. USA 104 9564–9569
2007
Earlier work this paper cites.
Shamir, RonR. andTsur, DekalD. (2007). Improved algorithms for the random cluster graph model. Random Structures Algorithms 31 418–449
2007
Earlier work this paper cites.
Vu, Van H.V. H. (2007). Spectral norm of random matrices. Combinatorica 27 721–736
2007
Earlier work this paper cites.
Bickel, Peter J.P. J. andChen, AiyouA. (2009). A nonparametric view of network models and Newman–Girvan and other modularities. Proc. Natl. Acad. Sci. USA 106 21068–21073
2009
Earlier work this paper cites.
Coja-Oghlan, AminA. andLanka, AndréA. (2009/10). Finding planted partitions in random graphs with general degree distributions. SIAM J. Discrete Math. 23 1682–1714
2009
Earlier work this paper cites.
Boyd, S.S., Parikh, N.N., Chu, E.E., Peleato, B.B. andEckstein, J.J. (2010). Distributed optimization and statistical learning via the alternating direction method of multipliers. Faund. Trends Mach. Learn. 3 1–122
2010
Cited alongside, same era.
Fienberg, Stephen E.S. E. (2010). Introduction to papers on the modeling and analysis of network data. Ann. Appl. Stat. 4 1–4
2010
Cited alongside, same era.
Goldenberg, AnnaA., Zheng, Alice X.A. X., Fienberg, Stephen E.S. E. andAiroldi, Edoardo M.E. M. (2010). A survey of statistical network models. Foundations and Trends in Machine Learning 2 129–233
2010
Cited alongside, same era.
Mathieu, ClaireC. andSchudy, WarrenW. (2010). Correlation clustering with noisy input. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms 712–728. SIAM, Philadelphia, PA
2010
Cited alongside, same era.
Candès, Emmanuel J.E. J., Strohmer, ThomasT. andVoroninski, VladislavV. (2013). PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming. Comm. Pure Appl. Math. 66 1241–1274
2013
Later among the works it cites.
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
Later among the works it cites.
Horn, Roger A.R. A. andJohnson, Charles R.C. R. (2013). Matrix Analysis, 2nd ed. Cambridge Univ. Press, Cambridge
2013
Later among the works it cites.
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Balakrishnan, S.S., Xu, M.M., Krishnamurthy, A.A. andSingh, A.A. (2011). Noise thresholds for spectral clustering (NIPS 2011). Adv. Neural Inf. Process. Syst. 25 954–962
2011
Cited alongside, same era.
Candès, Emmanuel J.E. J., Li, XiaodongX., Ma, YiY. andWright, JohnJ. (2011). Robust principal component analysis? J. ACM 58 Art. 11, 37
2011
Cited alongside, same era.
Decelle, A.A., Krzakala, F.F., Moore, C.C. andZdeborová, L.L. (2011). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Phys. Rev. E 84 066106
2011
Cited alongside, same era.
Karrer, BrianB. andNewman, M. E. J.M. E. J. (2011). Stochastic blockmodels and community structure in networks. Phys. Rev. E (3) 83 016107, 10
2011
Cited alongside, same era.
Kumar, AmitA., Sabharwal, YogishY. andSen, SandeepS. (2011). A simple linear time ( 1 + ϵ ) (1+\epsilon) -approximation algorithm for k k -means clustering in any dimensions. J. ACM 58 11
2011
Cited alongside, same era.
Lin, Z.Z., Liu, R.R. andSu, Z.Z. (2011). Linearized alternating direction method with adaptive penalty for low rank representation. In Advances in Neural Information Processing Systems (NIPS) 612–620
2011
Cited alongside, same era.
2011
Cited alongside, same era.
Celisse, AlainA., Daudin, Jean-JacquesJ.-J. andPierre, LaurentL. (2012). Consistency of maximum-likelihood and variational estimators in the stochastic block model. Electron. J. Stat. 6 1847–1899
2012
Cited alongside, same era.
Krzakala, FlorentF., Moore, CristopherC., Mossel, ElchananE., Neeman, JoeJ., Sly, AllanA., Zdeborová, LenkaL. andZhang, PanP. (2013). Spectral redemption in clustering sparse networks. Proc. Natl. Acad. Sci. USA 110 20935–20940
2013
Later among the works it cites.
Li, XiaodongX. andVoroninski, VladislavV. (2013). Sparse signal recovery from quadratic measurements via convex programming. SIAM J. Math. Anal. 45 3019–3033
2013
Later among the works it cites.
2013
Later among the works it cites.
Airoldi, E.E., Blei, M.M., Fienberg, S.S. andXing, E.E. (2008). Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9 1981–2014
2014
Closest in time.
Ames, Brendan P. W.B. P. W. (2014). Guaranteed clustering and biclustering via semidefinite programming. Math. Program. 147 429–465
2014
Closest in time.
Ames, Brendan P. W.B. P. W. andVavasis, Stephen A.S. A. (2014). Convex optimization for the planted k k -disjoint-clique problem. Math. Program. 143 299–337
2014
Closest in time.
2014
Closest in time.
Jalali, A.A., Chen, Y.Y., Sanghavi, S.S. andXu, H.H. (2014). Clustering partially observed graphs via convex optimization. J. Mach. Learn. Res. 15 2213–2238
2014
Closest in time.
Vu, V.V. (2014). A simple SVD algorithm for finding hidden partitions. Available at \arxivurl
2014
Closest in time.
Cai, T. andLi, X. (2015). Supplement to “Robust and computationally feasible community detection in the presence of arbitrary outlier nodes.” DOI: \doiurl
2015
Closest in time.
Deshpande, Y.Y. andMontanari, A.A. (2015). Finding hidden cliques of size N / e \sqrt{N/e} in nearly linear time. Found. Comput. Math. DOI: \doiurl
2015
Closest in time.
Jin, J.J. (2015). Fast network community detection by SCORE. Ann. Statist. 43 57–89
2015
Closest in time.
Lei, JingJ. andRinaldo, AlessandroA. (2015). Consistency of spectral clustering in stochastic block models. Ann. Statist. 43 215–237
2015
Closest in time.
Amini, Arash A.A. A., Chen, AiyouA., Bickel, Peter J.P. J. andLevina, ElizavetaE. (2013). Pseudo-likelihood methods for community detection in large sparse networks. Ann. Statist. 41 2097–2122
2097
Closest in time.