Defining, Calculating, and Converging Observables of a Kinetic Transition Network

100 Years of the Lennard-Jones Potential

It is now 100 years since Lennard-Jones published his first paper introducing the now famous potential that bears his name. It is therefore timely to reflect on the many achievements, as well as the limitations, of this potential in the theory of atomic and molecular interactions, where applications range from descriptions of intermolecular forces to molecules, clusters, and condensed matter.

Analysis and interpretation of first passage time distributions featuring rare events

In this contribution we consider theory and associated computational tools to treat the kinetics associated with competing pathways on multifunnel energy landscapes. Multifunnel landscapes are associated with molecular switches and multifunctional materials, and are expected to exhibit multiple relaxation time scales and associated thermodynamic signatures in the heat capacity. Our focus here is on the first passage time distribution, which is encoded in a kinetic transition network containing all the locally stable states and the pathways between them. This network can be renormalised to reduce the dimensionality, while exactly conserving the mean first passage time and approximately conserving the full distribution. The structure of the reduced network can be visualised using disconnectivity graphs. We show how features in the first passage time distribution can be associated with specific kinetic traps, and how the appearance of competing relaxation time scales depends on the starting conditions. The theory is tested for two model landscapes and applied to an atomic cluster and a disordered peptide. Our most important contribution is probably the reconstruction of the full distribution for long time scales, where numerical problems prevent direct calculations. Here we combine accurate treatment of the mean first passage time with the reliable part of the distribution corresponding to faster time scales. Hence we now have a fundamental understanding of both thermodynamic and kinetic signatures of multifunnel landscapes.

Analysing ill-conditioned Markov chains

Discrete state Markov chains in discrete or continuous time are widely used to model phenomena in the social, physical and life sciences. In many cases, the model can feature a large state space, with extreme differences between the fastest and slowest transition timescales. Analysis of such ill-conditioned models is often intractable with finite precision linear algebra techniques. In this contribution, we propose a solution to this problem, namely partial graph transformation, to iteratively eliminate and renormalize states, producing a low-rank Markov chain from an ill-conditioned initial model. We show that the error induced by this procedure can be minimized by retaining both the renormalized nodes that represent metastable superbasins, and those through which reactive pathways concentrate, i.e. the dividing surface in the discrete state space. This procedure typically returns a much lower rank model, where trajectories can be efficiently generated with kinetic path sampling. We apply this approach to an ill-conditioned Markov chain for a model multi-community system, measuring the accuracy by direct comparison with trajectories and transition statistics. This article is part of a discussion meeting issue 'Supercomputing simulations of advanced materials'.

Theoretical and computational methodologies for understanding coordination self-assembly complexes

This perspective highlights three theoretical and computational methods to capture the coordination self-assembly processes at the molecular level: quantum chemical modeling, molecular dynamics, and reaction network analysis. These methods cover the different scales from the metal-ligand bond to a more global aspect, and approaches that are best suited to understand the coordination self-assembly from different perspectives are introduced. Theoretical and numerical researches based on these methods are not merely ways of interpreting the experimental studies but complementary to them.

Fast Screening of Minimum Energy Crossing Points with Semiempirical Tight-Binding Methods

The investigation of photochemical processes is a highly active field in computational chemistry. One research direction is the automated exploration and identification of minimum energy conical intersection (MECI) geometries. However, due to the immense technical effort required to calculate nonadiabatic potential energy landscapes, the routine application of such computational protocols is severely limited. In this study, we will discuss the prospect of combining adiabatic potential energy surfaces from semiempirical quantum mechanical calculations with specialized confinement potential and metadynamics simulations to identify S₀/T₁ minimum energy crossing point (MECP) geometries. It is shown that MECPs calculated at the GFN2-xTB level can provide suitable approximations to high-level S₀/S₁ab initio conical intersection geometries at a fraction of the computational cost. Reference MECIs of benzene are studied to illustrate the basic concept. An example application of the presented protocol is demonstrated for a set of photoswitch molecules.

Dynamical Signatures of Multifunnel Energy Landscapes

Multifunctional systems, such as molecular switches, exhibit multifunnel energy landscapes associated with the alternative functional states. In this contribution the multifunnel organization is decoded from dynamical signatures in the first passage time distribution between reactants and products. Characteristic relaxation rates are revealed by analyzing the kinetics as a function of the observation time scale, which scans the underlying distribution. Extracting the corresponding dynamical signatures provides direct insight into the organization of the molecular energy landscape, which will facilitate a rational design of target functionality. Examples are illustrated for multifunnel landscapes in biomolecular systems and an atomic cluster.

Nanoparticle cluster formation mechanisms elucidated via Markov state modeling: Attraction range effects, aggregation pathways, and counterintuitive transition rates

Nanoparticle clusters are promising candidates for developing functional materials. However, it is still a challenging task to fabricate them in a predictable and controllable way, which requires investigation of the possible mechanisms underlying cluster formation at the nanoscale. By constructing Markov state models (MSMs) at the microstate level, we find that for highly dispersed particles to form a highly aggregated cluster, there are multiple coexisting pathways, which correspond to direct aggregation, or pathways that need to pass through partially aggregated, intermediate states. Varying the range of attraction between nanoparticles is found to significantly affect pathways. As the attraction range becomes narrower, compared to direct aggregation, some pathways that need to pass through partially aggregated intermediate states become more competitive. In addition, from MSMs constructed at the macrostate level, the aggregation rate is found to be counterintuitively lower with a lower free-energy barrier, which is also discussed.

Energy Landscapes for Base-Flipping in a Model DNA Duplex

We explore the process of base-flipping for four central bases, adenine, guanine, cytosine, and thymine, in a deoxyribonucleic acid (DNA) duplex using the energy landscape perspective. NMR imino-proton exchange and fluorescence correlation spectroscopy studies have been used in previous experiments to obtain lifetimes for bases in paired and extrahelical states. However, the difference of almost 4 orders of magnitude in the base-flipping rates obtained by the two methods implies that they are exploring different pathways and possibly different open states. Our results support the previous suggestion that minor groove opening may be favored by distortions in the DNA backbone and reveal links between sequence effects and the direction of opening, i.e., whether the base flips toward the major or the minor groove side. In particular, base flipping along the minor groove pathway was found to align toward the 5' side of the backbone. We find that bases align toward the 3' side of the backbone when flipping along the major groove pathway. However, in some cases for cytosine and thymine, the base flipping along the major groove pathway also aligns toward the 5' side. The sequence effect may be caused by the polar interactions between the flipping-base and its neighboring bases on either of the strands. For guanine flipping toward the minor groove side, we find that the equilibrium constant for opening is large compared to flipping via the major groove. We find that the estimated rates of base opening, and hence the lifetimes of the closed state, obtained for thymine flipping through small and large angles along the major groove differ by 6 orders of magnitude, whereas for thymine flipping through small angles along the minor groove and large angles along the major groove, the rates differ by 3 orders of magnitude.

Energy Landscapes of Carbon Clusters from Tight-Binding Quantum Potentials

We calculate transformation pathways between fullerene and octahedral carbon clusters and between a buckyball and its bowl-shaped isomer. The energies and gradients are provided by efficient tight-binding potentials, which are interfaced to our Energy Landscape exploration software. From the global energy landscape, we extract the mechanistic and kinetic parameters as a function of temperature, and compare our results to selected density functional theory (DFT) (PBE/cc-pVTZ) benchmarks. Infrared spectra are calculated to provide data for experimental identification of the clusters and differentiation of their isomers. Our results suggest that the formation of buckyballs from a buckybowl will be suppressed at elevated temperatures (above around 5250 K) due to entropic effects, which may provide useful insight into the detection of cosmic fullerenes.

The Energy Landscape Perspective: Encoding Structure and Function for Biomolecules

The energy landscape perspective is outlined with particular reference to biomolecules that perform multiple functions. We associate these multifunctional molecules with multifunnel energy landscapes, illustrated by some selected examples, where understanding the organisation of the landscape has provided new insight into function. Conformational selection and induced fit may provide alternative routes to realisation of multifunctionality, exploiting the possibility of environmental control and distinct binding modes.

Nearly reducible finite Markov chains: Theory and algorithms

Finite Markov chains, memoryless random walks on complex networks, appear commonly as models for stochastic dynamics in condensed matter physics, biophysics, ecology, epidemiology, economics, and elsewhere. Here, we review exact numerical methods for the analysis of arbitrary discrete- and continuous-time Markovian networks. We focus on numerically stable methods that are required to treat nearly reducible Markov chains, which exhibit a separation of characteristic timescales and are therefore ill-conditioned. In this metastable regime, dense linear algebra methods are afflicted by propagation of error in the finite precision arithmetic, and the kinetic Monte Carlo algorithm to simulate paths is unfeasibly inefficient. Furthermore, iterative eigendecomposition methods fail to converge without the use of nontrivial and system-specific preconditioning techniques. An alternative approach is provided by state reduction procedures, which do not require additional a priori knowledge of the Markov chain. Macroscopic dynamical quantities, such as moments of the first passage time distribution for a transition to an absorbing state, and microscopic properties, such as the stationary, committor, and visitation probabilities for nodes, can be computed robustly using state reduction algorithms. The related kinetic path sampling algorithm allows for efficient sampling of trajectories on a nearly reducible Markov chain. Thus, all of the information required to determine the kinetically relevant transition mechanisms, and to identify the states that have a dominant effect on the global dynamics, can be computed reliably even for computationally challenging models. Rare events are a ubiquitous feature of realistic dynamical systems, and so the methods described herein are valuable in many practical applications.

Numerical analysis of first-passage processes in finite Markov chains exhibiting metastability

We describe state-reduction algorithms for the analysis of first-passage processes in discrete- and continuous-time finite Markov chains. We present a formulation of the graph transformation algorithm that allows for the evaluation of exact mean first-passage times, stationary probabilities, and committor probabilities for all nonabsorbing nodes of a Markov chain in a single computation. Calculation of the committor probabilities within the state-reduction formalism is readily generalizable to the first hitting problem for any number of alternative target states. We then show that a state-reduction algorithm can be formulated to compute the expected number of times that each node is visited along a first-passage path. Hence, all properties required to analyze the first-passage path ensemble (FPPE) at both a microscopic and macroscopic level of detail, including the mean and variance of the first-passage time distribution, can be computed using state-reduction methods. In particular, we derive expressions for the probability that a node is visited along a direct transition path, which proceeds without returning to the initial state, considering both the nonequilibrium and equilibrium (steady-state) FPPEs. The reactive visitation probability provides a rigorous metric to quantify the dynamical importance of a node for the productive transition between two endpoint states and thus allows the local states that facilitate the dominant transition mechanisms to be readily identified. The state-reduction procedures remain numerically stable even for Markov chains exhibiting metastability, which can be severely ill-conditioned. The rare event regime is frequently encountered in realistic models of dynamical processes, and our methodology therefore provides valuable tools for the analysis of Markov chains in practical applications. We illustrate our approach with numerical results for a kinetic network representing a structural transition in an atomic cluster.

Graph transformation and shortest paths algorithms for finite Markov chains

The graph transformation (GT) algorithm robustly computes the mean first-passage time to an absorbing state in a finite Markov chain. Here we present a concise overview of the iterative and block formulations of the GT procedure and generalize the GT formalism to the case of any path property that is a sum of contributions from individual transitions. In particular, we examine the path action, which directly relates to the path probability, and analyze the first-passage path ensemble for a model Markov chain that is metastable and therefore numerically challenging. We compare the mean first-passage path action, obtained using GT, with the full path action probability distribution simulated efficiently using kinetic path sampling, and with values for the highest-probability paths determined by the recursive enumeration algorithm (REA). In Markov chains representing realistic dynamical processes, the probability distributions of first-passage path properties are typically fat-tailed and therefore difficult to converge by sampling, which motivates the use of exact and numerically stable approaches to compute the expectation. We find that the kinetic relevance of the set of highest-probability paths depends strongly on the metastability of the Markov chain, and so the properties of the dominant first-passage paths may be unrepresentative of the global dynamics. Use of a global measure for edge costs in the REA, based on net productive fluxes, allows the total reactive flux to be decomposed into a finite set of contributions from simple flux paths. By considering transition flux paths, a detailed quantitative analysis of the relative importance of competing dynamical processes is possible even in the metastable regime.

Optimal dimensionality reduction of Markov chains using graph transformation

Markov chains can accurately model the state-to-state dynamics of a wide range of complex systems, but the underlying transition matrix is ill-conditioned when the dynamics feature a separation of timescales. Graph transformation (GT) provides a numerically stable method to compute exact mean first passage times (MFPTs) between states, which are the usual dynamical observables in continuous-time Markov chains (CTMCs). Here, we generalize the GT algorithm to discrete-time Markov chains (DTMCs), which are commonly estimated from simulation data, for example, in the Markov state model approach. We then consider the dimensionality reduction of CTMCs and DTMCs, which aids model interpretation and facilitates more expensive computations, including sampling of pathways. We perform a detailed numerical analysis of existing methods to compute the optimal reduced CTMC, given a partitioning of the network into metastable communities (macrostates) of nodes (microstates). We show that approaches based on linear algebra encounter numerical problems that arise from the requisite metastability. We propose an alternative approach using GT to compute the matrix of intermicrostate MFPTs in the original Markov chain, from which a matrix of weighted intermacrostate MFPTs can be obtained. We also propose an approximation to the weighted-MFPT matrix in the strongly metastable limit. Inversion of the weighted-MFPT matrix, which is better conditioned than the matrices that must be inverted in alternative dimensionality reduction schemes, then yields the optimal reduced Markov chain. The superior numerical stability of the GT approach therefore enables us to realize optimal Markovian coarse-graining of systems with rare event dynamics.

Expanding the Structural Diversity of DNA Methyltransferase Inhibitors

Inhibitors of DNA methyltransferases (DNMTs) are attractive compounds for epigenetic drug discovery. They are also chemical tools to understand the biochemistry of epigenetic processes. Herein, we report five distinct inhibitors of DNMT1 characterized in enzymatic inhibition assays that did not show activity with DNMT3B. It was concluded that the dietary component theaflavin is an inhibitor of DNMT1. Two additional novel inhibitors of DNMT1 are the approved drugs glyburide and panobinostat. The DNMT1 enzymatic inhibitory activity of panobinostat, a known pan inhibitor of histone deacetylases, agrees with experimental reports of its ability to reduce DNMT1 activity in liver cancer cell lines. Molecular docking of the active compounds with DNMT1, and re-scoring with the recently developed extended connectivity interaction features approach, led to an excellent agreement between the experimental IC₅₀ values and docking scores.

Towards kinetic control of coordination self-assembly: a case study of a Pd3L6 double-walled triangle to predict the outcomes by a reaction network model

Numerical analysis of self-assembly process (NASAP) was performed for a [Pd3L6]6+ double-walled triangle (DWT) complex. With a chemical reaction network and a parameter set of the reaction rate constants obtained from a numerical search in an eighteen-dimensional parameter space to obtain a good fit to the data from the experimental counterpart (quantitative analysis of self-assembly process, QASAP), a refined calculation resulted in a detailed time evolution of each molecular species. Analysis based on those clues revealed dominant self-assembly pathways and a balance between inter- and intramolecular reactions, and enabled prediction of the reaction outcomes depending on the initial stoichiometric ratio under kinetic control.

Rare events and first passage time statistics from the energy landscape

We analyze the probability distribution of rare first passage times corresponding to transitions between product and reactant states in a kinetic transition network. The mean first passage times and the corresponding rate constants are analyzed in detail for two model landscapes and the double funnel landscape corresponding to an atomic cluster. Evaluation schemes based on eigendecomposition and kinetic path sampling, which both allow access to the first passage time distribution, are benchmarked against mean first passage times calculated using graph transformation. Numerical precision issues severely limit the useful temperature range for eigendecomposition, but kinetic path sampling is capable of extending the first passage time analysis to lower temperatures, where the kinetics of interest constitute rare events. We then investigate the influence of free energy based state regrouping schemes for the underlying network. Alternative formulations of the effective transition rates for a given regrouping are compared in detail to determine their numerical stability and capability to reproduce the true kinetics, including recent coarse-graining approaches that preserve occupancy cross correlation functions. We find that appropriate regrouping of states under the simplest local equilibrium approximation can provide reduced transition networks with useful accuracy at somewhat lower temperatures. Finally, a method is provided to systematically interpolate between the local equilibrium approximation and exact intergroup dynamics. Spectral analysis is applied to each grouping of states, employing a moment-based mode selection criterion to produce a reduced state space, which does not require any spectral gap to exist, but reduces to gap-based coarse graining as a special case. Implementations of the developed methods are freely available online.

Energy Landscape for the Membrane Fusion Pathway in Influenza A Hemagglutinin From Discrete Path Sampling

The conformational change associated with membrane fusion for Influenza A Hemagglutinin is investigated with a model based upon pre- and post-fusion structures of the HA2 component. We employ computational methods based on the potential energy landscape framework to obtain an initial path connecting these two end points, which provides the starting point for refinement of a kinetic transition network. Here we employ discrete path sampling, which provides access to the experimental time and length scales via geometry optimization techniques to identify local minima and the transition states that connect them. We then analyse the distinct phases of the predicted pathway in terms of structure and energetics, and compare with available experimental data and previous simulations. Our results provide the foundations for future work, which will address the effect of mutations, changes in pH, and incorporation of additional components, especially the HA1 chain and the fusion peptide.

Improving double-ended transition state searches for soft-matter systems

Transitions between different stable configurations of biomolecules are important in understanding disease mechanisms, structure-function relations, and novel molecular-scale engineering. The corresponding pathways can be characterized efficiently using geometry optimization schemes based on double-ended transition state searches. An interpolation is first constructed between the known states and then refined, yielding a band that contains transition state candidates. Here, we analyze an example where various interpolation schemes lead to bands with a single step transition, but the correct pathway actually proceeds via an intervening, low-energy minimum. We compare a number of different interpolation schemes for this problem. We systematically alter the number of discrete images in the interpolations and the spring constants used in the optimization and test two schemes for adjusting the spring constants and image distribution, resulting in a total of 2760 different connection attempts. Our results confirm that optimized bands are not necessarily a good description of the transition pathways in themselves, and further refinement to actually converge transition states and establish their connectivity is required. We see an improvement in the optimized bands if we employ the adjustment of spring constants with doubly-nudged elastic band and a smaller improvement from the image redistribution. The example we consider is representative of numerous cases we have encountered in a wide variety of molecular and condensed matter systems.