How robust are reconstruction thresholds for community detection?
From MaRDI portal
Publication:5361883
DOI10.1145/2897518.2897573zbMath1381.62190arXiv1511.01473OpenAlexW2963865651MaRDI QIDQ5361883
No author found.
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01473
semidefinite programmingcommunity detectionstochastic block modelbroadcast tree modelsemirandom models
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Semidefinite programming (90C22)
Related Items (12)
Efficient joint object matching via linear programming ⋮ Phase transitions in semidefinite relaxations ⋮ Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery ⋮ On semidefinite relaxations for the block model ⋮ Community Detection and Stochastic Block Models ⋮ Convex relaxation methods for community detection ⋮ Exact recovery in the Ising blockmodel ⋮ On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization ⋮ Partial recovery bounds for clustering with the relaxed \(K\)-means ⋮ Unnamed Item ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model ⋮ Graph Powering and Spectral Robustness
This page was built for publication: How robust are reconstruction thresholds for community detection?
