The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
Open accessAbstract
A central problem in data analysis is the low dimensional representation of high dimensional data and the concise description of its underlying geometry and density. In the analysis of large scale simulations of complex dynamical systems, where the notion of time evolution comes into play, important problems are the identification of slow variables and dynamically meaningful reaction coordinates that capture the long time evolution of the system. In this paper we provide a unifying view of these apparently different tasks, by considering a family of diffusion maps, defined as the embedding of complex (high dimensional) data onto a low dimensional Euclidean space, via the eigenvectors of suitably defined random walks defined on the given datasets. Assuming that the data is randomly sampled from an underlying general probability distribution p ( x ) = e − U ( x ) , we show that as the number of samples goes to infinity, the eigenvectors of each diffusion map converge to the eigenfunctions of a corresponding differential operator defined on the support of the probability distribution. Different normalizations of the Markov chain on the graph lead to different limiting differential operators. Specifically, the normalized graph Laplacian leads to a backward Fokker–Planck operator with an underlying potential of 2 U ( x ) , best suited for spectral clustering. A different anisotropic normalization of the random walk leads to the backward Fokker–Planck operator with the potential U ( x ) , best suited for the analysis of the long time asymptotics of high dimensional stochastic systems governed by a stochastic differential equation with the same potential U ( x ) . Finally, yet another normalization leads to the eigenfunctions of the Laplace–Beltrami (heat) operator on the manifold in which the data resides, best suited for the analysis of the geometry of the dataset regardless of its possibly non-uniform density.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Messiah, A. (1961) · Cited by 16,012
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
The Fokker-Planck Equation: Methods of Solution and Applications
Risken, H. (1996) · Springer Series in Synergetics · doi:10.1007/978-3-642-61544-3 · Cited by 9,056
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences
Gardiner, C. W. (1985) · Springer Series in Synergetics · doi:10.1007/978-3-662-02452-2 · Cited by 3,703
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
Self-citationThe Fokker-Planck Equation: Methods of Solution and Applications
Elgin, J. N. (1984) · Optica Acta: International Journal of Optics · doi:10.1080/713821438 · Cited by 1,089
Gear, C. W., Hyman, J. M., Kevrekidid, P. G., Kevrekidis, I. G., Runborg, O., & Theodoropoulos, C. (2003) · Communications in Mathematical Sciences · doi:10.4310/cms.2003.v1.n4.a5 · Cited by 776
Self-citationSegmentation using eigenvectors: a unifying view
Weiss, Y. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790354 · Cited by 729
Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences.
Gardiner, C. W., Bhat, U. N., Stoyan, D., Daley, D. J., Kutoyants, Y. A., & Rao, B. L. S. P. (1986) · Biometrics · doi:10.2307/2531274 · Cited by 717
Computing time scales from reaction coordinates by milestoning
Faradjian, A. K., & Elber, R. (2004) · The Journal of Chemical Physics · doi:10.1063/1.1738640 · Cited by 641
A Random Walks View of Spectral Segmentation.
Meilă, M., & Shi, J. (2001) · Cited by 623
A kernel view of the dimensionality reduction of manifolds
Ham, J., Lee, D. D., Mika, S., & Schölkopf, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015417 · Cited by 532
Theory and Applications of Stochastic Differential Equations
Schuss, Z., & O’Malley, R. E. (1981) · Physics Today · doi:10.1063/1.2914346 · Cited by 509
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
Theory and applications of stochastic differential equations
Williams, M. M. R. (1981) · Annals of Nuclear Energy · doi:10.1016/0306-4549(81)90056-6 · Cited by 455
Extracting macroscopic dynamics: model problems and algorithms
Givon, D., Kupferman, R., & Stuart, A. (2004) · Nonlinearity · doi:10.1088/0951-7715/17/6/r01 · Cited by 363
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
Self-citationFrom 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
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
Saerens, M., Fouss, F., Yen, L., & Dupont, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30115-8_35 · Cited by 219
Algorithm for Data Clustering in Pattern Recognition Problems Based on Quantum Mechanics
Horn, D., & Gottlieb, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.88.018702 · Cited by 212
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
Belkin, M. A., & Niyogi, P. (2005) · Lecture notes in computer science · doi:10.1007/11503415_33 · Cited by 174
Supersymmetry and the Bistable Fokker-Planck Equation
Bernstein, M. D., & Brown, L. S. (1984) · Physical Review Letters · doi:10.1103/physrevlett.52.1933 · Cited by 149
Data Clustering by Markovian Relaxation and the Information Bottleneck Method
Tishby, N., & Slonim, N. (2000) · Cited by 134
Clustering using a random walk based distance measure
Yen, L., VanVyve, D. J., Wouters, F., Fouss, F., Verleysen, M., & Saerens, M. (2005) · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · Cited by 93
Reaction paths based on mean first-passage times
Park, S., Şener, M., Lu, D., & Schulten, K. (2003) · The Journal of Chemical Physics · doi:10.1063/1.1570396 · Cited by 86
Extracting macroscopic stochastic dynamics: Model problems
Huisinga, W., Schütte, C., & Stuart, A. M. (2002) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.10057 · Cited by 38
Cited by
(2008) · Journal of Machine Learning Research · Cited by 33,051
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Coifman, R. R., & Lafon, S. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.04.006 · Cited by 2,342
Self-citationA Data–Driven Approximation of the Koopman Operator: Extending Dynamic Mode Decomposition
Williams, M. O., Kevrekidis, I. G., & Rowley, C. W. (2015) · Journal of Nonlinear Science · doi:10.1007/s00332-015-9258-5 · Cited by 1,945
Self-citation
Metadata
- Authors
- Nadler, B., Lafon, S., Coifman, R. R., & Kevrekidis, I. G.
- Venue
- Applied and Computational Harmonic Analysis
- Publisher
- Elsevier BV
- Published
- 2006-07
- Volume
- 21
- Issue
- 1
- Pages
- 113-127
- ISSN
- 1063-5203 (ISSN-L)
- OpenAlex
- W2117684310
- Cited by
- 990
- References
- 31
- FWCI
- 42.03
- 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
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.