Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
From MaRDI portal
Publication:2976866
DOI10.1109/TIT.2016.2546280zbMath1359.94222arXiv1412.6156OpenAlexW2567866584MaRDI QIDQ2976866
Jiaming Xu, Yihong Wu, Bruce Hajek
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/1412.6156
Related Items (43)
Joint Alignment from Pairwise Differences with a Noisy Oracle ⋮ Community Detection in Sparse Networks Using the Symmetrized Laplacian Inverse Matrix (SLIM) ⋮ Iterative algorithm for discrete structure recovery ⋮ Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Optimal Bipartite Network Clustering ⋮ The Ratio-Cut Polytope and K-Means Clustering ⋮ Unnamed Item ⋮ Exact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networks ⋮ Local law and Tracy-Widom limit for sparse stochastic block models ⋮ Optimal rates for community estimation in the weighted stochastic block model ⋮ Rate optimal Chernoff bound and application to community detection in the stochastic block models ⋮ Convexified modularity maximization for degree-corrected stochastic block models ⋮ Joint Community Detection and Rotational Synchronization via Semidefinite Programming ⋮ \(k\)-median: exact recovery in the extended stochastic ball model ⋮ Efficient joint object matching via linear programming ⋮ Multilayer hypergraph clustering using the aggregate similarity matrix ⋮ Community detection in the sparse hypergraph stochastic block model ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ Unnamed Item ⋮ A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization ⋮ Asymptotic uncertainty quantification for communities in sparse planted bi-section models ⋮ Community Detection in Censored Hypergraph ⋮ Spectral norm bounds for block Markov chain random matrices ⋮ Hidden Hamiltonian Cycle Recovery via Linear Programming ⋮ The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime ⋮ Memory-Efficient Structured Convex Optimization via Extreme Point Sampling ⋮ Unnamed Item ⋮ On semidefinite relaxations for the block model ⋮ Random Laplacian matrices and convex relaxations ⋮ Community Detection and Stochastic Block Models ⋮ Clustering in block Markov chains ⋮ Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log*|V|) time ⋮ Convex relaxation methods for community detection ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Community detection in degree-corrected block models ⋮ On the estimation of latent distances using graph distances ⋮ Unnamed Item ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs ⋮ Exact recovery in the Ising blockmodel ⋮ The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Non-convex exact community recovery in stochastic block model
This page was built for publication: Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
