mlsanityData to 7 Oct 2026

A simple SVD algorithm for finding hidden partitions

arXiv 1404.3918 ↗First posted 15 Apr 2014math.CO cs.DScited by 17

Not on the map. Why?

Abstract (arXiv)

Finding a hidden partition in a random environment is a general and important problem, which contains as subproblems many famous questions, such as finding a hidden clique, finding a hidden coloring, finding a hidden bipartition etc. In this paper, we provide a simple SVD algorithm for this purpose, answering a question of McSherry. This algorithm is very easy to implement and works for sparse graphs with optimal density.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Apr 2014.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 7; 2022: 7; 2023: 3.

17 papers.

Sort: