Transition path sampling

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Transition path sampling (TPS) is a rare-event sampling method used in computer simulations of rare events: physical or chemical transitions of a system from one stable state to another that occur too rarely to be observed on a computer timescale. Examples include protein folding, chemical reactions and nucleation. Standard simulation tools such as molecular dynamics can generate the dynamical trajectories of all the atoms in the system. However, because of the gap in accessible time-scales between simulation and reality, even present supercomputers might require years of simulations to show an event that occurs once per millisecond without some kind of acceleration.

Transition path sampling (TPS) is a rare-event sampling method used in computer simulations of rare events: physical or chemical transitions of a system from one stable state to another that occur too rarely to be observed on a computer timescale. Examples include protein folding, chemical reactions and nucleation. Standard simulation tools such as molecular dynamics can generate the dynamical trajectories of all the atoms in the system. However, because of the gap in accessible time-scales between simulation and reality, even present supercomputers might require years of simulations to show an event that occurs once per millisecond without some kind of acceleration. C(t) = \frac{\langle h_A(0) h_B(t) \rangle}{\langle h_A \rangle} , where h X is the characteristic function of state X, and h X (t) is either 1 if the system at time t is in state X or 0 if not. The time-derivative C'(t) starts at time 0 at the transition state theory (TST) value k AB TST and reaches a plateau k AB ≤ k AB TST for times of the order of the transition time. Hence once the function is known up to these times, the rate constant is also available. In the TPS framework C(t) can be rewritten as an average in the path ensemble k_{AB}^{TPS}(t) = \frac{d}{dt}C(t) = \frac{\langle \dot{h_B(t)} \rangle_{AB}}{\langle h_B(t') \rangle_{AB}} C(t') , where the subscript AB denotes an average in the ensemble of paths that start in A and visit B at least once. Time t is an arbitrary time in the plateau region of C(t). The factor C(t ' ) at this specific time can be computed with a combination of path sampling and umbrella sampling. k_{AB} = \Phi_{1,0} \prod_{i=1}^{n-1} P_A (i+1|i) , where P A (i + 1|i) is the probability for trajectories, coming from state A and crossing interface i, to reach interface i + 1. Here interface 0 defines state A and interface n defines state B. The factor Φ 1,0 is the flux through the interface closest to A. By making this interface close enough, the quantity can be computed with a standard simulation, as the crossing event through this interface is not a rare event any more. Remarkably, in the formula above there is no Markov assumption of independent transition probabilities. The quantities P A (i + 1|i) carry a subscript A to indicate that the probabilities are all dependent on the history of the path, all the way from when it left A. These probabilities can be computed with a path sampling simulation using the TPS shooting move. A path crossing interface i is perturbed and a new path is shot. If the path still starts from A and crosses interface i, is accepted. The probability P A (i + 1|i) follows from the ratio of the number of paths that reach interface i + 1 to the total number of paths in the ensemble. Theoretical considerations show that TIS computations are at least twice as fast as TPS, and computer experiments have shown that the TIS rate constant can converge up to 10 times faster. A reason for this is due to TIS using paths of adjustable length and on average shorter than TPS. Also, TPS relies on the correlation function C(t), computed by summation of positive and negative terms due to recrossings. TIS instead computes the rate as an effective positive flux, the quantity k AB is directly computed as an average of only positive terms contributing to the interface transition probabilities.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1330197632 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001330197632 · captured 1767053005.0 · version history

Cite this page as: encyclopegia.org, “Transition path sampling”, snapshot enwiki-001330197632. https://encyclopegia.org/a/transition-path-sampling

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.