The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
From graph to manifold Laplacian: The convergence rate
Open accessOverview
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
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., & Zucker, S. W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500334102 · Cited by 1,675
Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck operators
Nadler, B., Lafon, S., Coifman, R. R., & Kevrekidis, I. G. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0506090 · Cited by 294
From Graphs to Manifolds – Weak and Strong Pointwise Consistency of Graph Laplacians
Hein, M., Audibert, J.-Y., & von Luxburg, U. (2005) · Lecture Notes in Computer Science · doi:10.1007/11503415_32 · Cited by 270
Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., & Zucker, S. W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500896102 · Cited by 222
Intrinsic dimensionality estimation of submanifolds in Rd
Hein, M., & Audibert, J.-Y. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102388 · Cited by 185
Problems of learning on manifolds
Niyogi, P., & Belkin, M. A. (2003) · Cited by 124
Intrinsic Dimensionality Estimation of Submanifolds in R^d
Hein, M., & Audibert, J.-Y. (2005) · Cited by 21
Cited by
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Learning Laplacian Matrix in Smooth Graph Signal Representations
Dong, X., Thanou, D., Frossard, P., & Vandergheynst, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2602809 · Cited by 640
Towards a theoretical foundation for Laplacian-based manifold methods
Belkin, M., & Niyogi, P. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.08.006 · Cited by 464
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
Graph Laplacian Regularization for Image Denoising: Analysis in the Continuous Domain
Pang, J., & Cheung, G. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2651400 · Cited by 257
Metadata
- Authors
- Singer, A.
- Venue
- Applied and Computational Harmonic Analysis
- Publisher
- Elsevier BV
- Published
- 2006-07
- Volume
- 21
- Issue
- 1
- Pages
- 128-134
- ISSN
- 1063-5203 (ISSN-L)
- OpenAlex
- W1984032850
- Cited by
- 316
- References
- 9
- FWCI
- 9.57
- Type
- journal article
- Language
- en
- Open access
- bronze
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: From graph to manifold Laplacian: The convergence rate. https://app.cochat.ai/papers/10.1016/j.acha.2006.03.004
- The paper
- Singer, A. (2006). From graph to manifold Laplacian: The convergence rate. Applied and Computational Harmonic Analysis. https://doi.org/10.1016/j.acha.2006.03.004
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.