2020
DOI: 10.1016/j.acha.2018.05.001
|View full text |Cite
|
Sign up to set email alerts
|

Diffusion maps tailored to arbitrary non-degenerate Itô processes

Abstract: We present two generalizations of the popular diffusion maps algorithm. The first generalization replaces the drift term in diffusion maps, which is the gradient of the sampling density, with the gradient of an arbitrary density of interest which is known up to a normalization constant. The second generalization allows for a diffusion map type approximation of the forward and backward generators of general Itô diffusions with given drift and diffusion coefficients. We use the local kernels introduced by Berry … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(40 citation statements)
references
References 44 publications
0
40
0
Order By: Relevance
“…where ∆ is the Laplace-Beltrami operator on M and ∇ is the gradient operator on M. Note that in the special case α = 1/2, and for the choice π = Z −1 e −βV (Boltzmann-Gibbs), the approximated operator corresponds to the generator of overdamped Langevin dynamics (4), such that…”
Section: Langevin Dynamics and Diffusion Mapsmentioning
confidence: 99%
See 4 more Smart Citations
“…where ∆ is the Laplace-Beltrami operator on M and ∇ is the gradient operator on M. Note that in the special case α = 1/2, and for the choice π = Z −1 e −βV (Boltzmann-Gibbs), the approximated operator corresponds to the generator of overdamped Langevin dynamics (4), such that…”
Section: Langevin Dynamics and Diffusion Mapsmentioning
confidence: 99%
“…We use 10 4 points obtained by sub-sampling of the trajectory for the diffusion maps, which is chosen with kernel (6) and ε = 0.1. We compute the first two dominant eigenvectors and define the metastable subsets A and B using the first dominant eigenvector as described above 4 . In Figure 7(a) we see the sampling and the chosen sets.…”
Section: Algorithmic Identification Of Metastable Subsetsmentioning
confidence: 99%
See 3 more Smart Citations