Metraipolis › archive › dc_2ba4e83500d4

Topological Equivalence of Spectral and Density Cluster Hierarchies — arXiv:2610.31909

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.31909
License (as archived)
CC0-1.0
Archived
2026-10-26T20:11:32.455Z
SHA-256 of the archived text
70e7cc156c76d5165d6c975452160771f668be7ca51d42d32cc4eb58cd3cc44f
Stable URL of this page
https://metraipolis.com/documento/dc_2ba4e83500d4

How to cite

Topological Equivalence of Spectral and Density Cluster Hierarchies — arXiv:2610.31909 — arXiv (en), https://arxiv.org/abs/2610.31909 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2ba4e83500d4 (Metraipolis archive dc_2ba4e83500d4, sha256 70e7cc156c76d5165d6c975452160771f668be7ca51d42d32cc4eb58cd3cc44f)
BibTeX
@misc{dc2ba4e83500d4,
  title = {Topological Equivalence of Spectral and Density Cluster Hierarchies — arXiv:2610.31909},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.31909},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2ba4e83500d4; sha256 70e7cc156c76d5165d6c975452160771f668be7ca51d42d32cc4eb58cd3cc44f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.31909. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We compare two canonical ways to recover hierarchical clustering from an underlying density $f$: the \emph{density cluster tree} given by connected components of superlevel sets $\{f\ge\lambda\}$, and a \emph{spectral hierarchy} obtained by applying single linkage to diffusion distances induced by a Laplacian operator. We give conditions under which, at an appropriate diffusion time, the diffusion hierarchy is \emph{topologically equivalent} to the density cluster tree up to a monotone rescaling of heights. It further shows that a $k$-NN graph implementation inherits this equivalence from uniform approximation of diffusion distances, yielding a finite-sample reduction from spectral graph constructions to density-level-set topology.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.31909 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-26T19:49:03.369Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).