Communities in graphs with inhomogeneous latent geometry can be recovered by density-based spectral clustering on deeper eigenspaces, with a proven almost-exact recovery guarantee.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.SI 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Spectral graph clustering with inhomogeneous latent geometry
Communities in graphs with inhomogeneous latent geometry can be recovered by density-based spectral clustering on deeper eigenspaces, with a proven almost-exact recovery guarantee.