The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Convergence of Laplacian Eigenmaps
Abstract
Geometrically based methods for various tasks of data analysis have attracted considerable attention over the last few years. In many of these algorithms, a central role is played by the eigenvectors of the graph Laplacian of a data-derived graph. In this paper, we show that if points are sampled uniformly at random from an unknown submanifold M of R N, then the eigenvectors of a suitably constructed graph Laplacian converge to the eigenfunctions of the Laplace Beltrami operator on M. This basic result directly establishes the convergence of spectral manifold learning algorithms such as Laplacian Eigenmaps and Diffusion Maps. It also has implications for the understanding of geometric algorithms in data analysis, computational harmonic analysis, geometric random graphs, and graphics. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Finding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
Self-citation
Cited by
Diffusion Maps, Reduction Coordinates, and Low Dimensional Representation of Stochastic Systems
Coifman, R. R., Kevrekidis, I. G., Lafon, S., Maggioni, M., & Nadler, B. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070696325 · Cited by 279
Quantifying the effect of experimental perturbations at single-cell resolution
Burkhardt, D. B., Stanley, J. S., Tong, A., Perdigoto, A. L., Gigante, S. A., Herold, K. C., Wolf, G., Giraldez, A. J., van Dijk, D., & Krishnaswamy, S. (2021) · Nature Biotechnology · doi:10.1038/s41587-020-00803-5 · Cited by 226
Perraudin, N., Defferrard, M., Kacprzak, T., & Sgier, R. (2019) · Astronomy and Computing · doi:10.1016/j.ascom.2019.03.004 · Cited by 184
“Indeed, [34] showed that the graph Laplacian converges to the Laplace-Beltrami when the number of pixels goes to in-finity providing uniform sampling of the manifold and a fully connected graph built with exponentially decaying weights.”
Background
Metadata
- Authors
- Belkin, M., & Niyogi, P.
- Venue
- Advances in Neural Information Processing Systems 19
- Publisher
- The MIT Press
- Published
- 2007-09-07
- Pages
- 129-136
- OpenAlex
- W2163581538
- Cited by
- 222
- References
- 2
- FWCI
- 22.59
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convergence of Laplacian Eigenmaps. https://app.cochat.ai/papers/10.7551/mitpress/7503.003.0021
- The paper
- Belkin, M., & Niyogi, P. (2007). Convergence of Laplacian Eigenmaps. Advances in Neural Information Processing Systems 19. https://doi.org/10.7551/mitpress/7503.003.0021
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.