Fetching the paper…
Reading the bibliography…
We analyze the performance of spectral clustering for community extraction in stochastic block models.
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.
Bhatia, RajendraR. (1997). Matrix Analysis. Graduate Texts in Mathematics 169. Springer, New York
1997
Earlier work this paper cites.
Charikar, MosesM., Guha, SudiptoS., Tardos, ÉvaÉ. andShmoys, David B.D. B. (1999). A constant-factor approximation algorithm for the k k -median problem. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing 1–10. ACM, New York, NY
1999
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, Los Alamitos, CA
2001
Earlier work this paper cites.
Ng, Andrew Y.A. Y., Jordan, Michael I.M. I., Weiss, YairY. et al. (2002). On spectral clustering: Analysis and an algorithm. Adv. Neural Inf. Process. Syst. 2 849–856
2002
Earlier work this paper cites.
Alon, NogaN. andSpencer, Joel H.J. H. (2004). The Probabilistic Method, 2nd ed. Wiley, Hoboken
2004
Earlier work this paper cites.
Kumar, AmitA., Sabharwal, YogishY. andSen, SandeepS. (2004). A simple linear time ( 1 + ε 1+\varepsilon )-approximation algorithm for k k -means clustering in any dimensions. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science 454–462. IEEE Computer Society, Washington, DC
2004
Earlier work this paper cites.
Newman, Mark E. J.M. E. J. andGirvan, MichelleM. (2004). Finding and evaluating community structure in networks. Phys. Rev. E (3) 69 026113
2004
Earlier work this paper cites.
Feige, UrielU. andOfek, EranE. (2005). Spectral techniques applied to sparse random graphs. Random Structures Algorithms 27 251–275
2005
Earlier work this paper cites.
von Luxburg, UlrikeU. (2007). A tutorial on spectral clustering. Stat. Comput. 17 395–416
2007
Earlier work this paper cites.
Aloise, DanielD., Deshpande, AmitA., Hansen, PierreP. andPopat, PreyasP. (2009). NP-hardness of Euclidean sum-of-squares clustering. Machine Learning 75 245–248
2009
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.
Kolaczyk, Eric D.E. D. (2009). Statistical Analysis of Network Data: Methods and Models. Springer, New York
2009
Earlier work this paper cites.
Coja-Oghlan, AminA. (2010). Graph partitioning via adaptive spectral techniques. Combin. Probab. Comput. 19 227–284
2010
Earlier work this paper cites.
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
Earlier work this paper cites.
Kumar, AmitA. andKannan, RavindranR. (2010). Clustering with spectral norm and the k k -means algorithm. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science FOCS 299–308. IEEE, Los Alamitos, CA
2010
Cited alongside, same era.
Newman, M. E. J.M. E. J. (2010). Networks: An Introduction. Oxford Univ. Press, Oxford
2010
Cited alongside, same era.
Balakrishnan, SivaramanS., Xu, MinM., Krishnamurthy, AkshayA. andSingh, AartiA. (2011). Noise thresholds for spectral clustering. In Advances in Neural Information Processing Systems 24 (J.J. Shawe-Taylor, R. S.R. S. Zemel, P. L.P. L. Bartlett, F.F. Pereira andK. Q.K. Q. Weinberger, eds.) 954–962. Curran Associates, Red Hook, NY
2011
Cited alongside, same era.
Chung, FanF. andRadcliffe, MaryM. (2011). On the spectra of general random graphs. Electron. J. Combin. 18 Paper 215, 14
2011
Cited alongside, same era.
Sussman, Daniel L.D. L., Tang, MinhM., Fishkind, Donniell E.D. E. andPriebe, Carey E.C. E. (2012). A consistent adjacency spectral embedding for stochastic blockmodel graphs. J. Amer. Statist. Assoc. 107 1119–1128
2012
Later among the works it cites.
Tropp, Joel A.J. A. (2012). User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12 389–434
2012
Later among the works it cites.
2013
Closest in time.
2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Decelle, AurelienA., Krzakala, FlorentF., Moore, CristopherC. andZdeborová, LenkaL. (2011). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Phys. Rev. E (3) 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.
2012
Cited alongside, same era.
Awasthi, PranjalP. andSheffet, OrO. (2012). Improved spectral-norm bounds for clustering. In Approximation, Randomization, and Combinatorial Optimization. Lecture Notes in Computer Science 7408 37–49. Springer, Heidelberg
2012
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.
Channarond, AntoineA., Daudin, Jean-JacquesJ.-J. andRobin, StéphaneS. (2012). Classification and estimation in the stochastic blockmodel based on the empirical degrees. Electron. J. Stat. 6 2574–2601
2012
Cited alongside, same era.
Chaudhuri, KamalikaK., Chung, FanF. andTsiatas, AlexanderA. (2012). Spectral clustering of graphs with general degrees in the extended planted partition model. JMLR: Workshop and Conference Proceedings 2012 35.1–35.23
2012
Cited alongside, same era.
Chen, YudongY., Sanghavi, SujayS. andXu, HuanH. (2012). Clustering sparse graphs. In Advances in Neural Information Processing Systems 25 (F.F. Pereira, C. J. C.C. J. C. Burges, L.L. Bottou andK. Q.K. Q. Weinberger, eds.) 2204–2212. Curran Associates, Red Hook, NY
2012
Cited alongside, same era.
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.
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
Closest in time.
Li, ShiS. andSvensson, OlaO. (2013). Approximating k-median via pseudo-approximation. In Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing 901–910. ACM, New York
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
2013
Closest in time.
Vu, Vincent Q.V. Q. andLei, JingJ. (2013). Minimax sparse principal subspace estimation in high dimensions. Ann. Statist. 41 2905–2947
2013
Closest in time.
Lei, JingJ. andRinaldo, AlessandroA. (2014). Supplement to “Consistency of spectral clustering in stochastic block models.” DOI: \doiurl
2014
Closest in time.