Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log*|V|) time
暂无分享,去创建一个
Bruce E. Hajek | Jiaming Xu | Yihong Wu | B. Hajek | Yihong Wu | Jiaming Xu
[1] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[2] Laurent Massoulié,et al. Reconstruction in the labeled stochastic block model , 2013, 2013 IEEE Information Theory Workshop (ITW).
[3] Pravesh Kothari,et al. SoS and Planted Clique: Tight Analysis of MPW Moments at all Degrees and an Optimal Lower Bound at Degree Four , 2015, ArXiv.
[4] Emmanuel Abbe,et al. Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap , 2015, ArXiv.
[5] E. Arias-Castro,et al. Community detection in dense random networks , 2014 .
[6] Elchanan Mossel,et al. Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.
[7] N. Alon,et al. Finding a large hidden clique in a random graph , 1998 .
[8] Laurent Massoulié,et al. Distributed user profiling via spectral methods , 2010, SIGMETRICS '10.
[9] Bruce E. Hajek,et al. Submatrix localization via message passing , 2015, J. Mach. Learn. Res..
[10] Amin Coja-Oghlan,et al. Graph Partitioning via Adaptive Spectral Techniques , 2009, Combinatorics, Probability and Computing.
[11] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[12] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[13] W. Kahan,et al. The Rotation of Eigenvectors by a Perturbation. III , 1970 .
[14] Bruce E. Hajek,et al. Computational Lower Bounds for Community Detection on Random Graphs , 2014, COLT.
[15] Andrea Montanari,et al. Finding Hidden Cliques of Size $$\sqrt{N/e}$$N/e in Nearly Linear Time , 2013, Found. Comput. Math..
[16] Elchanan Mossel,et al. A Proof of the Block Model Threshold Conjecture , 2013, Combinatorica.
[17] Elchanan Mossel,et al. Density Evolution in the Degree-correlated Stochastic Block Model , 2015, COLT.
[18] U. Feige,et al. Finding hidden cliques in linear time , 2009 .
[19] Yuval Peres,et al. Finding Hidden Cliques in Linear Time with High Probability , 2010, Combinatorics, Probability and Computing.
[20] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[21] U. Feige,et al. Spectral techniques applied to sparse random graphs , 2005 .
[22] T. Kailath. The Divergence and Bhattacharyya Distance Measures in Signal Selection , 1967 .
[23] H. Kesten,et al. Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes , 1966 .
[24] Laurent Massoulié,et al. Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[25] Elchanan Mossel,et al. Consistency Thresholds for the Planted Bisection Model , 2014, STOC.
[26] H. Vincent Poor,et al. An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.
[27] 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.
[28] 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..
[29] Andrea Montanari,et al. On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors , 2014, IEEE Transactions on Information Theory.
[30] R. Karp,et al. Algorithms for graph partitioning on the planted partition model , 2001 .
[31] Andrea Montanari,et al. Finding One Community in a Sparse Graph , 2015, Journal of Statistical Physics.
[32] Andrea Montanari,et al. Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems , 2015, COLT.
[33] Avi Wigderson,et al. Sum-of-squares Lower Bounds for Planted Clique , 2015, STOC.
[34] Alexandre Proutière,et al. Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms , 2014, ArXiv.
[35] Elchanan Mossel,et al. Local Algorithms for Block Models with Side Information , 2015, ITCS.
[36] I. Shevtsova,et al. An improvement of the Berry–Esseen inequality with applications to Poisson and mixed Poisson random sums , 2009, 0912.2795.
[37] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.
[38] Bruce E. Hajek,et al. Achieving exact cluster recovery threshold via semidefinite programming , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[39] Elchanan Mossel,et al. Reconstruction and estimation in the planted partition model , 2012, Probability Theory and Related Fields.
[40] Stephen A. Vavasis,et al. Nuclear norm minimization for the planted clique and biclique problems , 2009, Math. Program..
[41] Prasad Raghavendra,et al. Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program , 2015, ArXiv.