Recovering Nonuniform Planted Partitions via Iterated Projection

Sam Cole

In the planted partition problem, the $n$ vertices of a random graph are partitioned into $k$ "clusters," and edges between vertices in the same cluster and different clusters are…