Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions

DOI10.1109/TIT.2016.2594812zbMath1359.94951arXiv1502.07738OpenAlexW2963545258MaRDI QIDQ2976594

Bruce Hajek, Jiaming Xu, Yihong Wu

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07738

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of graph theory to circuits and networks (94C15)

Related Items

Iterative algorithm for discrete structure recovery, Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information, Optimal Bipartite Network Clustering, Community detection with a subsampled semidefinite program, Unnamed Item, Optimal rates for community estimation in the weighted stochastic block model, Convexified modularity maximization for degree-corrected stochastic block models, Joint Community Detection and Rotational Synchronization via Semidefinite Programming, Entrywise eigenvector analysis of random matrices with low expected rank, A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization, Hidden Hamiltonian Cycle Recovery via Linear Programming, Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery, The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Maximum likelihood estimation of sparse networks with missing observations, On semidefinite relaxations for the block model, Random Laplacian matrices and convex relaxations, Convex relaxation methods for community detection, Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Community detection in degree-corrected block models, Rate-optimal graphon estimation, Consistent nonparametric estimation for heavy-tailed sparse graphs, The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime, Unnamed Item