For soft geometric block models with k communities, an algorithm using the k-1 eigenvalues closest to a model-dependent value, followed by k-means and local refinement, recovers all communities with vanishing error.
20, Springer, 2010
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Multi-Community Spectral Clustering for Geometric Graphs
For soft geometric block models with k communities, an algorithm using the k-1 eigenvalues closest to a model-dependent value, followed by k-means and local refinement, recovers all communities with vanishing error.