18 research outputs found

    Kinetics and Free Energy of Ligand Dissociation Using Weighted Ensemble Milestoning

    Full text link
    We consider the recently developed weighted ensemble milestoning (WEM) scheme [J. Chem. Phys. 152, 234114 (2020)], and test its capability of simulating ligand-receptor dissociation dynamics. We performed WEM simulations on the following host-guest systems: Na+^+/Cl−^- ion pair and 4-hydroxy-2-butanone (BUT) ligand with FK506 binding protein (FKBP). As proof or principle, we show that the WEM formalism reproduces the Na+^+/Cl−^- ion pair dissociation timescale and the free energy profile obtained from long conventional MD simulation. To increase accuracy of WEM calculations applied to kinetics and thermodynamics in protein-ligand binding, we introduced a modified WEM scheme called weighted ensemble milestoning with restraint release (WEM-RR), which can increase the number of starting points per milestone without adding additional computational cost. WEM-RR calculations obtained a ligand residence time and binding free energy in agreement with experimental and previous computational results. Moreover, using the milestoning framework, the binding time and rate constants, dissociation constant and the committor probabilities could also be calculated at a low computational cost. We also present an analytical approach for estimating the association rate constant (konk_{\text{on}}) when binding is primarily diffusion driven. We show that the WEM method can efficiently calculate multiple experimental observables describing ligand-receptor binding/unbinding and is a promising candidate for computer-aided inhibitor design

    Variational deep learning of equilibrium transition path ensembles

    Full text link
    We present a time dependent variational method to learn the mechanisms of equilibrium reactive processes and efficiently evaluate their rates within a transition path ensemble. This approach builds off variational path sampling methodology by approximating the time dependent commitment probability within a neural network ansatz. The reaction mechanisms inferred through this approach are elucidated by a novel decomposition of the rate in terms of the components of a stochastic path action conditioned on a transition. This decomposition affords an ability to resolve the typical contribution of each reactive mode and their couplings to the rare event. The associated rate evaluation is variational and systematically improvable through the development of a cumulant expansion. We demonstrate this method in both over- and under-damped stochastic equations of motion, in low-dimensional model systems and the isomerization of solvated alanine dipeptide. In all examples, we find that we can obtain quantitatively accurate estimates of the rates of the reactive events with minimal trajectory statistics, and gain unique insight into the transitions through the analysis of their commitment probability

    A weak characterization of slow variables in stochastic dynamical systems

    Full text link
    We present a novel characterization of slow variables for continuous Markov processes that provably preserve the slow timescales. These slow variables are known as reaction coordinates in molecular dynamical applications, where they play a key role in system analysis and coarse graining. The defining characteristics of these slow variables is that they parametrize a so-called transition manifold, a low-dimensional manifold in a certain density function space that emerges with progressive equilibration of the system's fast variables. The existence of said manifold was previously predicted for certain classes of metastable and slow-fast systems. However, in the original work, the existence of the manifold hinges on the pointwise convergence of the system's transition density functions towards it. We show in this work that a convergence in average with respect to the system's stationary measure is sufficient to yield reaction coordinates with the same key qualities. This allows one to accurately predict the timescale preservation in systems where the old theory is not applicable or would give overly pessimistic results. Moreover, the new characterization is still constructive, in that it allows for the algorithmic identification of a good slow variable. The improved characterization, the error prediction and the variable construction are demonstrated by a small metastable system

    Recent advances in describing and driving crystal nucleation using machine learning and artificial intelligence

    Full text link
    With the advent of faster computer processors and especially graphics processing units (GPUs) over the last few decades, the use of data-intensive machine learning (ML) and artificial intelligence (AI) has increased greatly, and the study of crystal nucleation has been one of the beneficiaries. In this review, we outline how ML and AI have been applied to address four outstanding difficulties of crystal nucleation: how to discover better reaction coordinates (RCs) for describing accurately non-classical nucleation situations; the development of more accurate force fields for describing the nucleation of multiple polymorphs or phases for a single system; more robust identification methods for determining crystal phases and structures; and as a method to yield improved course-grained models for studying nucleation.Comment: 15 pages; 1 figur

    Target search of active particles in complex environments

    Full text link
    Microswimmers are microscopic active agents capable of harvesting energy from the surrounding environment and converting it into self-propulsion and directed motion. This peculiar feature characterizes them as out-of-equilibrium systems that break microscopic reversibility. The problem of finding a specific target in a complex environment is essential for these agents since it is employed for a variety of purposes, from foraging nourishment to escaping potential threats. Here, we provide a detailed study of the target search process for microswimmers exploring complex environments. To this end, we generalize Transition Path Theory, the rigorous statistical mechanics description of transition processes, to the target-search problem. One of the main results of this thesis is the generalization to non-equilibrium systems of the Transition Path Sampling (TPS) algorithm, which was originally designed to simulate rare transitions in passive systems. The TPS algorithm relies on microscopic reversibility for its functioning, therefore its generalization to out-of-equilibrium systems lacking detailed balance and microscopic reversibility has remained a major challenge. Within this work, we generalize the TPS algorithm to the case of an active Brownian particle, i.e. a paradigmatic model for microswimmers, and we obtain a first insight into the counterintuitive target-search pathways explored by these agents. The second result of this thesis is a systematic characterization of the target-search path ensemble for an active particle exploring an energy landscape. The third and final original contribution of this Ph.D. thesis is the generalization of the concept of the committor function to target-search problems, with a validation of our theory against experiments of a camphor self-propelled disk.Comment: Ph.D. thesi

    Data-driven methods to estimate the committor function in conceptual ocean models

    Get PDF
    In recent years, several climate subsystems have been identified that may undergo a relatively rapid transition compared to the changes in their forcing. Such transitions are rare events in general, and simulating long-enough trajectories in order to gather sufficient data to determine transition statistics would be too expensive. Conversely, rare events algorithms like TAMS (trajectory-adaptive multilevel sampling) encourage the transition while keeping track of the model statistics. However, this algorithm relies on a score function whose choice is crucial to ensure its efficiency. The optimal score function, called the committor function, is in practice very difficult to compute. In this paper, we compare different data-based methods (analog Markov chains, neural networks, reservoir computing, dynamical Galerkin approximation) to estimate the committor from trajectory data. We apply these methods on two models of the Atlantic Ocean circulation featuring very different dynamical behavior. We compare these methods in terms of two measures, evaluating how close the estimate is from the true committor and in terms of the computational time. We find that all methods are able to extract information from the data in order to provide a good estimate of the committor. Analog Markov Chains provide a very reliable estimate of the true committor in simple models but prove not so robust when applied to systems with a more complex phase space. Neural network methods clearly stand out by their relatively low testing time, and their training time scales more favorably with the complexity of the model than the other methods. In particular, feedforward neural networks consistently achieve the best performance when trained with enough data, making this method promising for committor estimation in sophisticated climate models.</p

    Dimensionality Reduction of Complex Metastable Systems via Kernel Embeddings of Transition Manifolds

    Get PDF
    Abstract We present a novel kernel-based machine learning algorithm for identifying the low-dimensional geometry of the effective dynamics of high-dimensional multiscale stochastic systems. Recently, the authors developed a mathematical framework for the computation of optimal reaction coordinates of such systems that is based on learning a parameterization of a low-dimensional transition manifold in a certain function space. In this article, we enhance this approach by embedding and learning this transition manifold in a reproducing kernel Hilbert space, exploiting the favorable properties of kernel embeddings. Under mild assumptions on the kernel, the manifold structure is shown to be preserved under the embedding, and distortion bounds can be derived. This leads to a more robust and more efficient algorithm compared to the previous parameterization approaches

    Physics of Ionic Conduction in Narrow Biological and Artificial Channels

    Get PDF
    The book reprints a set of important scientific papers applying physics and mathematics to address the problem of selective ionic conduction in narrow water-filled channels and pores. It is a long-standing problem, and an extremely important one. Life in all its forms depends on ion channels and, furthermore, the technological applications of artificial ion channels are already widespread and growing rapidly. They include desalination, DNA sequencing, energy harvesting, molecular sensors, fuel cells, batteries, personalised medicine, and drug design. Further applications are to be anticipated.The book will be helpful to researchers and technologists already working in the area, or planning to enter it. It gives detailed descriptions of a diversity of modern approaches, and shows how they can be particularly effective and mutually reinforcing when used together. It not only provides a snapshot of current cutting-edge scientific activity in the area, but also offers indications of how the subject is likely to evolve in the future
    corecore