23 February 2024 in The Journal of Chemical Physics
Many chemical reactions and molecular processes occur on time scales that are significantly longer than those accessible by direct simulations. One successful approach to estimating dynamical statistics for such processes is to use many short time series of observations of the system to construct a Markov state model, which approximates the dynamics of the system as memoryless transitions between a set of discrete states. The dynamical Galerkin approximation (DGA) is a closely related framework for estimating dynamical statistics, such as committors and mean first passage times, by approximating solutions to their equations with a projection onto a basis. Because the projected dynamics are generally not memoryless, the Markov approximation can result in significant systematic errors. Inspired by quasi-Markov state models, which employ the generalized master equation to encode memory resulting from the projection, we reformulate DGA to account for memory and analyze its performance on two systems: a two-dimensional triple well and the AIB9 peptide. We demonstrate that our method is robust to the choice of basis and can decrease the time series length required to obtain accurate kinetics by an order of magnitude.
26 August 2024 in The Journal of Chemical Physics
An issue for molecular dynamics simulations is that events of interest often involve timescales that are much longer than the simulation time step, which is set by the fastest timescales of the model. Because of this timescale separation, direct simulation of many events is prohibitively computationally costly. This issue can be overcome by aggregating information from many relatively short simulations that sample segments of trajectories involving events of interest. This is the strategy of Markov state models (MSMs) and related approaches, but such methods suffer from approximation error because the variables defining the states generally do not capture the dynamics fully. By contrast, once converged, the weighted ensemble (WE) method aggregates information from trajectory segments so as to yield unbiased estimates of both thermodynamic and kinetic statistics. Unfortunately, errors decay no faster than unbiased simulation in WE as originally formulated and commonly deployed. Here, we introduce a theoretical framework for describing WE that shows that the introduction of an approximate stationary distribution on top of the stratification, as in nonequilibrium umbrella sampling (NEUS), accelerates convergence. Building on ideas from MSMs and related methods, we generalize the NEUS approach in such a way that the approximation error can be reduced systematically. We show that the improved algorithm can decrease the simulation time required to achieve the desired precision by orders of magnitude.
7 October 2024 in bioRxiv
Multiple SARS-CoV-2 variants have arisen during the first years of the pandemic, often bearing many new mutations. Several explanations have been offered for the surprisingly sudden emergence of multiple mutations that enhance viral fitness, including cryptic transmission, spillover from animal reservoirs, epistasis between mutations, and chronic infections. Here, we simulated pathogen evolution combining within-host replication and between-host transmission. We found that, under certain conditions, chronic infections can lead to SARS-CoV-2-like bursts of mutations even without epistasis. Chronic infections can also increase the global evolutionary rate of a pathogen even in the absence of clear mutational bursts. Overall, our study supports chronic infections as a plausible origin for highly mutated SARS-CoV-2 variants. More generally, we also describe how chronic infections can influence pathogen evolution under different scenarios.
8 September 2026 in The Journal of Chemical Physics
Molecular motors and other complex nonequilibrium systems are controlled by large sets of design parameters, and optimizing those parameters requires computing sensitivities—derivatives of dynamical observables with respect to the parameters. When the system’s dynamics involves rare events, both the observable and its sensitivity are difficult to estimate from direct simulation. We present a practical computational pipeline that addresses both challenges by combining importance sampling with a Markov state model (MSM). The MSM separately captures the slow, rare-event dynamics and the fast, local dynamics, and the chain rule connects those two pieces to yield an efficient sensitivity estimator. An iterative reweighting procedure based on the RiteWeight algorithm substantially reduces approximation errors from the MSM coarse-graining. We validate the approach on diffusion in the Müller–Brown potential, where the sensitivity of a transition rate to landscape parameters can be computed exactly. We then use sensitivities to optimize the directional bias of a particle-based model of a catalysis-driven molecular motor.