mlsanityData to 7 Oct 2026

Spectral Convergence of the connection Laplacian from random samples

arXiv 1306.1587 ↗First posted 7 Jun 2013math.NA cs.NA math.STcited by 19

Not on the map. Why?

Abstract (arXiv)

Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as Diffusion Maps and Laplacian Eigenmaps are often used for manifold learning and non-linear dimensionality reduction. It was previously shown by Belkin and Niyogi citebelkinniyogi:2007 that the eigenvectors and eigenvalues of the graph Laplacian converge to the eigenfunctions and eigenvalues of the Laplace-Beltrami operator of the manifold in the limit of infinitely many data points sampled independently from the uniform distribution over the manifold. Recently, we introduced Vector Diffusion Maps and showed that the connection Laplacian of the tangent bundle of the manifold can be approximated from random samples. In this paper, we present a unified framework for approximating other connection Laplacians over the manifold by considering its principle bundle structure. We prove that the eigenvectors and eigenvalues of these Laplacians converge in the limit of infinitely many independent random samples. We generalize the spectral convergence results to the case where the data points are sampled from a non-uniform distribution, and for manifolds with and without boundary.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Jun 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 5; 2023: 2; 2024: 2; 2025: 4; 2026: 3.

19 papers.

Sort:

  1. 2021Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolationcited by 24
  2. 2023Tangent Bundle Convolutional Learning: from Manifolds to Cellular Sheaves and Backcited by 21
  3. 2022Tangent Bundle Filters and Neural Networks: from Manifolds to Cellular Sheaves and Backcited by 9
  4. 2021Large sample spectral analysis of graph-based multi-manifold clusteringcited by 8
  5. 2022Learning Low-Dimensional Nonlinear Structures from High-Dimensional Noisy Data: An Integral Operator Approachcited by 8
  6. 2022Bi-stochastically normalized graph Laplacian: convergence to manifold Laplacian and robustness to outlier noisecited by 7
  7. 2023Implicit Gaussian process representation of vector fields over arbitrary latent manifoldscited by 6
  8. 2021Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphscited by 5
  9. 2022SpecNet2: Orthogonalization-free spectral embedding by neural networkscited by 5
  10. 2022Understanding the Generalization Performance of Spectral Clustering Algorithmscited by 4
  11. 2024Landmark Alternating Diffusioncited by 2
  12. 2024Spectral Self-supervised Feature Selectioncited by 1
7 more
  1. 2025VDW-GNNs: Vector diffusion wavelets for geometric graph neural networkscited by 1
  2. 2025Higher-Order Regularization Learning on Hypergraphscited by 1
  3. 2025Convergence of graph Dirichlet energies and graph Laplacians on intersecting manifolds of varying dimensionscited by 0
  4. 2025Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalizationcited by 0
  5. 2026Generalized Robust Adaptive-Bandwidth Multi-View Manifold Learning in High Dimensions with Noisecited by 0
  6. 2026Accelerate Vector Diffusion Maps by Landmarkscited by 0
  7. 2026Learning manifold diffusion semigroups from graph transition matricescited by 0