Communication: Analysing kinetic transition networks for rare events
Jacob D Stevenson1, David J Wales1
1University Chemical Laboratories, University of Cambridge, Lensfield Road, Cambridge CB2 1EW, United Kingdom.
Abstract:
The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods, focusing on large, sparse networks. We show that graph transformation provides a much more robust framework, succeeding when numerical precision issues cause the other methods to fail completely. These are precisely the situations that correspond to rare event dynamics for which the graph transformation was introduced.
More Related Videos
09:17Structure-Based Simulation and Sampling of Transcription Factor Protein Movements along DNA from Atomic-Scale Stepping to Coarse-Grained Diffusion
Published on: March 1, 2022
11:22Using Three-color Single-molecule FRET to Study the Correlation of Protein Interactions
Published on: January 30, 2018
Related Concept Videos
Energy Diagrams, Transition States, and Intermediates
Reaction Mechanisms: Rate-limiting Step Approximation
Elimination Kinetics: First-Order and Zero-Order
Drug clearance depends on the rate of drug elimination and its plasma concentration. Another important parameter is a drug's half-life, which is the time required for its concentration to decrease by half. In most cases, drug clearance follows first-order...
Cooperative Allosteric Transitions
Cooperative Allosteric Transitions
Cooperative Allosteric Transitions
