A simple spectral algorithm for recovering planted partitions
In this paper, we consider the planted partition model, in which n = ks vertices of a random graph are partitioned into k “clusters,” each of size s. Edges between vertices in the same cluster and different clusters are included with constant probability p and q, respectively (where 0 ≤ q < p ≤ 1...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2017-01-01
|
| Series: | Special Matrices |
| Online Access: | https://doi.org/10.1515/spma-2017-0013 |