Spectral Detection in the Censored Block Model
Not on the map. Why?
Abstract (arXiv)
We consider the problem of partially recovering hidden binary variables from the observation of (few) censored edge weights, a problem with applications in community detection, correlation clustering and synchronization. We describe two spectral algorithms for this task based on the non-backtracking and the Bethe Hessian operators. These algorithms are shown to be asymptotically optimal for the partial recovery problem, in that they detect the hidden assignment as soon as it is information theoretically possible to do so.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Jan 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 1; 2025: 1.
5 papers.
- 2021Semidefinite Programming for Community Detection with Side Informationcited by 3
- 2021Community Detection: Exact Recovery in Weighted Graphscited by 2
- 2024Low coordinate degree algorithms II: Categorical signals and generalized stochastic block modelscited by 2
- 2023Community Detection with Known, Unknown, or Partially Known Auxiliary Latent Variablescited by 1
- 2025Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noisecited by 0
- 2025Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise9 Oct 2025
- 2024Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models30 Dec 2024
- 2023Community Detection with Known, Unknown, or Partially Known Auxiliary Latent Variables8 Jan 2023
- 2021Semidefinite Programming for Community Detection with Side Information6 May 2021
- 2021Community Detection: Exact Recovery in Weighted Graphs8 Feb 2021