Fetching the paper…
Reading the bibliography…
This paper surveys recent theoretical advances in convex optimization approaches for community detection.
[author] Rohe, K.K., Chatterjee, S.S. and Yu, B.B. (2011). Spectral clustering and the high-dimensional stochastic blockmodel. Ann. Statist. 39 1878-1915
1915
Earlier work this paper cites.
[author] Grothendieck, AlexanderA. (1953). Résumé de la théorie métrique des produits tensoriels topologiques. Resenhas do Instituto de Matemática e Estatistica da Universidade de São Paulo 2 401–481
1953
Earlier work this paper cites.
[author] Lindenstrauss, JoramJ. and Pełczyński, AlexanderA. (1968). Absolutely summing operators in L p L_{p} -spaces and their applications. Studia Mathematica 3 275–326
1968
Earlier work this paper cites.
[author] Holland, P. W.P. W., Laskey, K. B.K. B. and Leinhardt, S.S. (1983). Stochastic blockmodels: First steps. Social Networks 5 109–137
1983
Earlier work this paper cites.
[author] Goemans, Michel XM. X. and Williamson, David PD. P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM) 42 1115–1145
1995
Earlier work this paper cites.
[author] Boyd, S.S. and Vandenberghe, L.L. (2004). Convex Optimization. Cambridge University Press, New York, NY, USA
2004
Earlier work this paper cites.
[author] Feige, U.U. and Ofek, E.E. (2005). Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27 251–275. 10.1002/rsa.v27:2
2005
Earlier work this paper cites.
[author] Newman, M. E. J.M. E. J. (2006). Modularity and community structure in networks. PNAS 103 8577-8582. 10.1073/pnas.0601602103
2006
Earlier work this paper cites.
[author] Reichardt, J.J. and Bornholdt, S.S. (2006). Statistical mechanics of community detection. Phys. Rev. E 74
2006
Earlier work this paper cites.
[author] Wright, StephenS. and Nocedal, JorgeJ. (2006). Numerical Optimization 35, Second ed. Springer
2006
Earlier work this paper cites.
[author] Fortunato, SantoS. and Barthelemy, MarcM. (2007). Resolution limit in community detection. Proceedings of the National Academy of Sciences 104 36–41
2007
Earlier work this paper cites.
[author] Peng, J.J. and Wei, Y.Y. (2007). Approximating k-means-type clustering via semidefinite programming. SIAM Journal on Optimization 18 186–205
2007
Earlier work this paper cites.
[author] Mathieu, C.C. and Schudy, W.W. (2010). Correlation clustering with noisy input. Proceeding SODA ’10 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms 712–728
2010
Earlier work this paper cites.
[author] Decelle, AurelienA., Krzakala, FlorentF., Moore, CristopherC. and Zdeborová, LenkaL. (2011). Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Physical Review E 84 066106
2011
Earlier work this paper cites.
[author] Lancichinetti, A.A. and Fortunato, S.S. (2011). Limits of modularity maximization in community detection. Phys. Rev. E 84
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
[author] Chaudhuri, K.K., Chung, F.F. and Tsiatas, A.A. (2012). Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model. Journal of Machine Learning Research 35.1-35.23
2012
Cited alongside, same era.
[author] Krzakala, F.F., Moore, C.C., Mossel, E.E., Neeman, J.J., Sly, A.A., Zdeborová, L.L. and Zhang, P.P. (2013). Spectral redemption in clustering sparse networks. Proc. Natl. Acad. Sci. USA 110 20935–20940
2013
Cited alongside, same era.
2013
Cited alongside, same era.
[author] Mossel, ElchananE., Neeman, JoeJ. and Sly, AllanA. (2013). A proof of the block model threshold conjecture. Combinatorica 1–44
2013
Cited alongside, same era.
[author] Perry, W.W. and Wein, A. S.A. S. (2015). A semidefinite program for unbalanced multisection in the stochastic block model. arXiv 1507.05605
2015
Later among the works it cites.
[author] Abbe, E.E., Bandeira, A. S.A. S. and Hall, G.G. (2016). Exact Recovery in the Stochastic Block Model. IEEE Transactions on Information Theory 62 471–487. arXiv 1405.3267
2016
Later among the works it cites.
Bandeira, A. S
2016
Later among the works it cites.
[author] Bandeira, Afonso SA. S., Van Handel, RamonR. et al. (2016). Sharp nonasymptotic bounds on the norm of random matrices with independent entries. The Annals of Probability 44 2479–2506
2016
Later among the works it cites.
Makarychev, K
2016
Later among the works it cites.
Moitra, A
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
[author] Ames, B. P.B. P. (2014). Guaranteed clustering and biclustering via semidefinite programming. Mathematical Programming: Series A and B archive 147 429–465
2014
Cited alongside, same era.
[author] Ames, B. P.B. P. and Vavasis, S. A.S. A. (2014). Convex optimization for the planted k k -disjoint-clique. Mathematical Programming 143 299–337
2014
Cited alongside, same era.
[author] Amini, A. A.A. A. and Levina, E.E. (2014). On semidefinite relaxations for the block model. ArXiv e-prints 1406.5647
2014
Cited alongside, same era.
[author] Chen, YY., Sanghavi, SS. and Xu, HH. (2014). Improved graph clustering. IEEE Transactions on Information Theory 60 6440–6455
2014
Cited alongside, same era.
[author] Chen, YudongY., Jalali, AliA., Sanghavi, SujayS. and Xu, HuanH. (2014). Clustering partially observed graphs via convex optimization. Journal of Machine Learning Research 15 2213–2238
2014
Cited alongside, same era.
[author] Hajek, B.B., Wu, Y.Y. and Xu, J.J. (2016a). Achieving Exact Cluster Recovery Threshold via Semidefinite Programming. IEEE Transactions on Information Theory 62 2788-2797. (arXiv 1412.6156 Nov. 2014)
2014
Cited alongside, same era.
[author] Vu, V.V. (2014). A simple SVD algorithm for finding hidden partitions. arXiv:1404.3918
2014
Cited alongside, same era.
[author] Agarwal, N.N., Bandeira, A. S.A. S., Koiliaris, K.K. and Kolla, A.A. (2015). Multisection in the Stochastic Block Model using Semidefinite Programming. arXiv 1507.02323
2015
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
[author] Lim, Shiau HongS. H., Chen, YudongY. and Xu, HuanH. (2017). Clustering from General Pairwise Observations with Applications to Time-varying Graphs. Journal of Machine Learning Research 18 1-47
2017
Later among the works it cites.
2017
Later among the works it cites.
[author] Bandeira, Afonso SA. S. (2018). Random Laplacian matrices and convex relaxations. Foundations of Computational Mathematics 18 345–379
2018
Closest in time.
[author] Chen, YudongY., Li, XiaodongX. and Xu, JiamingJ. (2018). Convexified modularity maximization for degree-corrected stochastic block models. The Annals of Statistics 46 1573–1602
2018
Closest in time.
2018
Closest in time.
[author] Yan, BoweiB., Sarkar, PurnamritaP. and Cheng, XiuyuanX. (2018). Provable Estimation of the Number of Blocks in Block Models. Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS) 2018, Lanzarote, Spain
2018
Closest in time.