# A variational approach to the consistency of spectral clustering

arXiv: https://arxiv.org/abs/1508.01928 · HTML: https://mlsanity.com/paper/1508.01928/

## Key facts

- Cited by 28 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Aug 2015.

## Built on by (most cited first, 28 of 28)

- [Neural Operator: Learning Maps Between Function Spaces](https://mlsanity.com/paper/2108.08481/) (2021)
- [Manifold learning: what, how, and why](https://mlsanity.com/paper/2311.03757/) (2023)
- [Minimax Optimal Regression over Sobolev Spaces via Laplacian Regularization on Neighborhood Graphs](https://mlsanity.com/paper/2106.01529/) (2021)
- [A Multiscale Environment for Learning by Diffusion](https://mlsanity.com/paper/2102.00500/) (2021)
- [Large sample spectral analysis of graph-based multi-manifold clustering](https://mlsanity.com/paper/2107.13610/) (2021)
- [Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphs](https://mlsanity.com/paper/2111.07394/) (2021)
- [Adaptive and non-adaptive minimax rates for weighted Laplacian-eigenmap based nonparametric regression](https://mlsanity.com/paper/2311.00140/) (2023)
- [Understanding the Generalization Performance of Spectral Clustering Algorithms](https://mlsanity.com/paper/2205.00281/) (2022)
- [Rates of Convergence for Regression with the Graph Poly-Laplacian](https://mlsanity.com/paper/2209.02305/) (2022)
- [Manifold Filter-Combine Networks](https://mlsanity.com/paper/2307.04056/) (2023)
- [Spectral Neural Networks: Approximation Theory and Optimization Landscape](https://mlsanity.com/paper/2310.00729/) (2023)
- [Nonsmooth Nonparametric Regression via Fractional Laplacian Eigenmaps](https://mlsanity.com/paper/2402.14985/) (2024)
- [Robust Certification for Laplace Learning on Geometric Graphs](https://mlsanity.com/paper/2104.10837/) (2021)
- [Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation](https://mlsanity.com/paper/2108.08687/) (2021)
- [Conditional expectation using compactification operators](https://mlsanity.com/paper/2306.10592/) (2023)
- [Graph Laplacian-based Bayesian Multi-fidelity Modeling](https://mlsanity.com/paper/2409.08211/) (2024)
- [Higher-Order Regularization Learning on Hypergraphs](https://mlsanity.com/paper/2510.26533/) (2025)
- [Manifold limit for the training of shallow graph convolutional neural networks](https://mlsanity.com/paper/2601.06025/) (2026)
- [Diffusion Processes on Implicit Manifolds](https://mlsanity.com/paper/2604.07213/) (2026)
- [Learning to Orchestrate Agents under Uncertainty](https://mlsanity.com/paper/2605.27073/) (2026)
- [Finsler Geometry, Graph Neural Networks, and You](https://mlsanity.com/paper/2606.17185/) (2026)
- [A few-shot graph Laplacian-based approach for improving the accuracy of low-fidelity data](https://mlsanity.com/paper/2304.04862/) (2023)
- [Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser](https://mlsanity.com/paper/2305.06541/) (2023)
- [Convergence of graph Dirichlet energies and graph Laplacians on intersecting manifolds of varying dimensions](https://mlsanity.com/paper/2509.24458/) (2025)
- [Topology-Aware Active Learning on Graphs](https://mlsanity.com/paper/2510.25892/) (2025)
- [Large Data Limits of Laplace Learning for Gaussian Measure Data in Infinite Dimensions](https://mlsanity.com/paper/2601.14515/) (2026)
- [Fast determinantal sampling on general spaces and diffusion geometry](https://mlsanity.com/paper/2607.06644/) (2026)
- [Group Invariant Spectral Embedding](https://mlsanity.com/paper/2607.08987/) (2026)

## Abstract (arXiv)

This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. We investigate the spectral convergence of both unnormalized and normalized graph Laplacians towards the appropriate operators in the continuum domain. We obtain sharp conditions on how the connectivity radius can be scaled with respect to the number of sample points for the spectral convergence to hold. We also show that the discrete clusters obtained via spectral clustering converge towards a continuum partition of the ground truth measure. Such continuum partition minimizes a functional describing the continuum analogue of the graph-based spectral partitioning. Our approach, based on variational convergence, is general and flexible.