Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
暂无分享,去创建一个
[1] E. Arias-Castro,et al. Community detection in dense random networks , 2014 .
[2] R. Karp,et al. Algorithms for graph partitioning on the planted partition model , 2001 .
[3] Laurent Massoulié,et al. Distributed user profiling via spectral methods , 2014 .
[4] Yoav Seginer,et al. The Expected Norm of Random Matrices , 2000, Combinatorics, Probability and Computing.
[5] Alexandra Kolla,et al. Multisection in the Stochastic Block Model using Semidefinite Programming , 2015, ArXiv.
[6] Cristopher Moore,et al. Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[7] Yudong Chen,et al. Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices , 2014, J. Mach. Learn. Res..
[8] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.
[9] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[10] Noga Alon,et al. A Spectral Technique for Coloring Random 3-Colorable Graphs , 1997, SIAM J. Comput..
[11] N. Alon,et al. Finding a large hidden clique in a random graph , 1998 .
[12] Alexander S. Wein,et al. A semidefinite program for unbalanced multisection in the stochastic block model , 2017, 2017 International Conference on Sampling Theory and Applications (SampTA).
[13] Uriel Feige,et al. Heuristics for Semirandom Graph Problems , 2001, J. Comput. Syst. Sci..
[14] Emmanuel Abbe,et al. Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms , 2015, ArXiv.
[15] Elchanan Mossel,et al. Reconstruction and estimation in the planted partition model , 2012, Probability Theory and Related Fields.
[16] Emmanuel Abbe,et al. Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[17] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[18] Afonso S. Bandeira,et al. Random Laplacian Matrices and Convex Relaxations , 2015, Found. Comput. Math..
[19] Laurent Massoulié,et al. Community detection thresholds and the weak Ramanujan property , 2013, STOC.
[20] Bruce E. Hajek,et al. Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions , 2015, IEEE Transactions on Information Theory.
[21] Alan M. Frieze,et al. Improved approximation algorithms for MAXk-CUT and MAX BISECTION , 1995, Algorithmica.
[22] U. Feige,et al. Spectral techniques applied to sparse random graphs , 2005 .
[23] M E J Newman,et al. Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[24] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[25] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[26] Emmanuel Abbe,et al. Exact Recovery in the Stochastic Block Model , 2014, IEEE Transactions on Information Theory.
[27] Bruce E. Hajek,et al. Computational Lower Bounds for Community Detection on Random Graphs , 2014, COLT.
[28] Elchanan Mossel,et al. A Proof of the Block Model Threshold Conjecture , 2013, Combinatorica.
[29] Elchanan Mossel,et al. Consistency Thresholds for the Planted Bisection Model , 2014, STOC.
[30] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.