2015
DOI: 10.1063/1.4913214
|View full text |Cite
|
Sign up to set email alerts
|

Gaussian Markov transition models of molecular kinetics

Abstract: The slow processes of molecular dynamics (MD) simulations--governed by dominant eigenvalues and eigenfunctions of MD propagators--contain essential information on structures of and transition rates between long-lived conformations. Existing approaches to this problem, including Markov state models and the variational approach, represent the dominant eigenfunctions as linear combinations of a set of basis functions. However the choice of the basis functions and their systematic statistical estimation are unsolv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
1

Relationship

7
0

Authors

Journals

citations
Cited by 20 publications
(23 citation statements)
references
References 32 publications
(45 reference statements)
0
23
0
Order By: Relevance
“…The resulting coordinates may be scaled, in order to embed them in a metric space whose distances correspond to some form of dynamical distance [31,32]. The resulting metric space is discretized by clustering the projected data using hard or fuzzy data-based clustering methods [11,13,[33][34][35][36][37], typically resulting in 100-1000 discrete states. A transition matrix or rate matrix describing the transition probabilities or rate between the discrete states at some lag time τ is then estimated [8,12,38,39] (alternatively, a Koopman model can be built after the dimension reduction [27,28]).…”
Section: Introductionmentioning
confidence: 99%
“…The resulting coordinates may be scaled, in order to embed them in a metric space whose distances correspond to some form of dynamical distance [31,32]. The resulting metric space is discretized by clustering the projected data using hard or fuzzy data-based clustering methods [11,13,[33][34][35][36][37], typically resulting in 100-1000 discrete states. A transition matrix or rate matrix describing the transition probabilities or rate between the discrete states at some lag time τ is then estimated [8,12,38,39] (alternatively, a Koopman model can be built after the dimension reduction [27,28]).…”
Section: Introductionmentioning
confidence: 99%
“…Markov state models provide both eigenvectors (as left and right eigenvectors of the transition matrix). Moreover it is possible to design Markov transition models [35] such that both sets of eigenvectors can be computed. For nonreversible dynamics, there can be complex eigenvalues and eigenvectors which come in complex conjugate pairs (λ j , φ j , ψ j ) and (λ j ,φ j ,ψ j ).…”
Section: Computing Kinetic Distances and Kinetic Mapsmentioning
confidence: 99%
“…The first question has been answered: building on conformation dynamics theory [29,28,24,15] it has been shown that the eigenfunctions of the backward Markov propagator underlying the MD are the optimal reaction coordinates: Projecting the dynamics upon these eigenfunctions will give rise to a maximum estimate of the timescales [23,15,17] and an optimal separation of metastable states. A number of approaches are available to approximate these reaction coordinates from MD data: Diffusion maps [26], Markov state models [24] and Markov transition models [35], TICA [18,30] and kernel TICA [31]. The variational approach for conformation dynamics (VAC) [15,17] is a generalization to all aforementioned models except for diffusion maps and describes a general approach to combine and parametrize basis functions so as to optimally define the true eigenfunctions of the backward propagator.…”
Section: Introductionmentioning
confidence: 99%
“…6 This important property can also be achieved for other basis sets that are probability densities, such as Gaussian distributions. 35 For arbitrary basis functions, estimator Eqs. (25) and 26are incorrect if the data are not in global equilibrium.…”
Section: A Methods Of Linear Variationmentioning
confidence: 99%
“…where we have used recursion formula Eq. (35). Next, we can compute the approximation error for g p+1 k p via…”
Section: Appendix D: Least Squares Approximation Of Interfacesmentioning
confidence: 99%