Refine
Year of publication
Document Type
- Article (212)
- ZIB-Report (70)
- In Proceedings (23)
- In Collection (9)
- Book chapter (7)
- Book (2)
- Doctoral Thesis (2)
- Other (2)
- Poster (2)
- Habilitation (1)
Is part of the Bibliography
- no (332)
Keywords
- metastability (8)
- cycle decomposition (3)
- rare events (3)
- reaction coordinate (3)
- Bayesian inference (2)
- Clustering (2)
- DS-MLE (2)
- EM algorithm (2)
- Jeffreys prior (2)
- MPLE (2)
- Markov chain (2)
- Markov operator (2)
- Markov state model (2)
- Mathematical modeling (2)
- Model Selection, (2)
- NPMLE (2)
- Networks (2)
- Real-time cell analyzer (2)
- Stochastic Block Model (2)
- Toxicity (2)
- Variational Bayes EM (2)
- canonical ensemble (2)
- change of measure (2)
- coarse graining (2)
- conformation (2)
- cross-entropy method (2)
- directed networks (2)
- effective dynamics (2)
- essential degrees of freedom (2)
- hybrid Monte Carlo (2)
- hyperparameter (2)
- hyperprior (2)
- importance sampling (2)
- metadynamics (2)
- metastable sets (2)
- molecular dynamics (2)
- neural networks (2)
- non-equilibrium molecular dynamics (2)
- nonequilibrium molecular dynamics (2)
- optimal control (2)
- principle of maximum entropy (2)
- rare event simulation (2)
- reference prior (2)
- stochastic control (2)
- stochastic optimal control (2)
- transfer operator (2)
- transition manifold (2)
- unsupervised classification (2)
- $n$-pentane molecule (1)
- Alanine dipeptide (1)
- Bayesian hierarchical modeling (1)
- Bayesian hierarchical modelling (1)
- Coarse graining (1)
- Complex networks (1)
- Donsker-Varadhan principle (1)
- Electric field (1)
- Epidemiology (1)
- Ergodic diffusion (1)
- Floquet theory (1)
- Fokker--Planck equation (1)
- Galerkin method (1)
- Girsanov (1)
- Girsanov Theorem (1)
- Girsanov transformation (1)
- Ha (1)
- Hamiltonian dynamics (1)
- Hamiltonian system (1)
- IC_{50} (1)
- Importance Sampling (1)
- Importance sampling (1)
- Infectious Diseases (1)
- MSM (1)
- Markov process (1)
- Markov state models (1)
- Markov states model (1)
- Markow State Methods (1)
- Microbiology (1)
- Module identification and classification (1)
- Monte Carlo (1)
- Monte Carlo methods (1)
- Noise (1)
- Non-equilibrium (1)
- Opioid, Ligand-Receptor Interaction, Binding Kinetics, Molecular Dynamics, Metadynamics, SQRA (1)
- Parameter estimation (1)
- Parasitology (1)
- Perron cluster an (1)
- Perron root (1)
- Perron- (1)
- Public Health, Environmental and Occupational Health (1)
- QCMD (1)
- Reweighting (1)
- Schrödinger equation (1)
- Schur decomposition (1)
- Smoluchowski dynamics (1)
- Smoluchowski equation (1)
- Stochastic Differential Equation (1)
- Transfer operator (1)
- Virology (1)
- Wigner transform (1)
- Windkessel model (1)
- adaptive resolution (1)
- adiabatic limit (1)
- almost invariant aggregates (1)
- almost invariant set (1)
- almost invariant sets (1)
- alternating linear scheme (1)
- anastomosis (1)
- application in statistical physics (1)
- asymptotic expansion (1)
- bellmann equation (1)
- biochemical conformation (1)
- biomolecular conformations (1)
- bridge sampling (1)
- cardiovascular parameters (1)
- chemical master equation (1)
- chemical potential (1)
- cluster method (1)
- coherent set, (1)
- communication (1)
- computational cardiovascular model (1)
- conformation dynamics (1)
- conformational dynamics (1)
- conformational ensemble (1)
- cross entropy (1)
- cross-correlation (1)
- cumulant generating function (1)
- data-driven (1)
- diagnostic frequency (1)
- directed networks, modules, cycle decomposition, measure of node communication (1)
- dynamic programming (1)
- embedding (1)
- equation-free (1)
- essential molecular dynamics (1)
- first exit time (1)
- half time perio (1)
- heterogeneous catalysis (1)
- heterogeneous multiscale method (1)
- hidden state (1)
- hierarchical annealing (1)
- highly oscillatory phase (1)
- hitting times (1)
- important sampling (1)
- information costs (1)
- kinetic Monte Carlo (1)
- linear reaction networks (1)
- linear response (1)
- long timescales (1)
- master equation (1)
- meshfree basis (1)
- mesoscale spreading process (1)
- mesoscale spreading process, network inference, time-evolving network, romanization spreading, scarce data (1)
- minimum discrimination information (1)
- model reduction (1)
- molecular transition networks (1)
- moleculare dynamics (1)
- nearly completely decomposable (1)
- nearly reducible (1)
- nearly uncoupled Markov chain (1)
- network inference (1)
- neurotransmission (1)
- non-adiabatic processes (1)
- non-linear dynamics (1)
- non-reversible Markov chain (1)
- non-stationary forcing (1)
- nonadiabatic effects (1)
- nonreversible Markov processes (1)
- optimal pathways (1)
- optimal therapeutic policies (1)
- parameter estimation (1)
- peptide aggregation dynamics (1)
- quantum adiabati (1)
- quantum-classical Liouville equation (1)
- quantum-classical molecular dynamics (1)
- quasi-compact operator (1)
- random walk (1)
- ratio of normalizing co (1)
- reaction-diffusion (1)
- reactive trajectories (1)
- recurrence quantification analysis (1)
- representative (1)
- resource-poor (1)
- resource-rich (1)
- reweighting (1)
- romanization spreading (1)
- scarce data (1)
- semigroup of Markov operators (1)
- sensitivity analysis (1)
- slow dynamics (1)
- small noise (1)
- stochastic approximation (1)
- stochastic chemical kinetics (1)
- structural and dynamical similarity (1)
- surface hopping (1)
- tensor decompositions (1)
- tensor train format (1)
- thermodynamic free energy (1)
- threshold (1)
- time series analysis (1)
- time-evolving network (1)
- trans (1)
- transfer operations (1)
- transi (1)
- transition path theory (1)
- transition probabilities (1)
- transition prohability (1)
- two timescale master equation (1)
Institute
- Numerical Mathematics (151)
- Modeling and Simulation of Complex Processes (58)
- ZIB Allgemein (29)
- Visual and Data-centric Computing (23)
- Computational Systems Biology (18)
- Computational Molecular Design (13)
- Visual Data Analysis (13)
- Mathematics for Life and Materials Science (5)
- Bioinformatics in Medicine (3)
- AI in Society, Science, and Technology (1)
- Distributed Algorithms and Supercomputing (1)
- Geometric Data Analysis and Processing (1)
- Image Analysis in Biology and Materials Science (1)
- Mathematical Algorithmic Intelligence (1)
- Parallel and Distributed Computing (1)
- Visual Data Analysis in Science and Engineering (1)
Applications of the cross-entropy method to importance sampling and optimal control of diffusions
(2014)
We study the cross-entropy method for diffusions. One of the results is a versatile cross-entropy algorithm that can be used to design efficient importance sampling strategies for rare events or to solve optimal control problems. The approach is based on the minimization of a suitable cross-entropy functional, with a parametric family of exponentially tilted probability distributions. We illustrate the new algorithm with several numerical examples and discuss algorithmic issues and possible extensions of the method.
Applications of the cross-entropy method to importance sampling and optimal control of diffusions
(2014)
Many interesting rare events in molecular systems like ligand association, protein folding or con- formational changes happen on timescales that often are not accessible by direct numerical simulation. Therefore rare event approximation approaches like interface sampling, Markov state model building or advanced reaction coordinate based free energy estimation have attracted huge attention recently. In this article we analyze the reliability of such approaches: How precise is an estimate of long relaxation timescales of molecular systems resulting from various forms of rare event approximation methods? Our results give a theoretical answer to this question by relating it with the transfer operator approach to molecular dynamics. By doing so they also allow for understanding deep connections between the different approaches.
High-dimensional metastable molecular dynamics (MD) can often be characterised by a few features of the system, that is, collective variables (CVs). Thanks to the rapid advance in the area of machine learning and deep learning, various deep learning-based CV identification techniques have been developed in recent years, allowing accurate modelling and efficient simulation of complex molecular systems. In this paper, we look at two different categories of deep learning-based approaches for finding CVs, either by computing leading eigenfunctions of transfer operator associated to the underlying dynamics, or by learning an autoencoder via minimisation of reconstruction error. We present a concise overview of the mathematics behind these two approaches and conduct a comparative numerical study of these two approaches on illustrative examples.
This paper is concerned with collective variables, or reaction coordinates, that map a discrete-in-time Markov process X_n in R^d to a (much) smaller dimension k≪d. We define the effective dynamics under a given collective variable map ξ as the best Markovian representation of X_n under ξ. The novelty of the paper is that it gives strict criteria for selecting optimal collective variables via the properties of the effective dynamics. In particular, we show that the transition density of the effective dynamics of the optimal collective variable solves a relative entropy minimization problem from certain family of densities to the transition density of X_n. We also show that many transfer operator-based data-driven numerical approaches essentially learn quantities of the effective dynamics. Furthermore, we obtain various error estimates for the effective dynamics in approximating dominant timescales / eigenvalues and transition rates of the original process X_n and how optimal collective variables minimize these errors. Our results contribute to the development of theoretical tools for the understanding of complex dynamical systems, e.g. molecular kinetics, on large timescales. These results shed light on the relations among existing data-driven numerical approaches for identifying good collective variables, and they also motivate the development of new methods.
In this paper, we consider the eigenvalue PDE problem of the infinitesimal generators of metastable diffusion processes. We propose a numerical algorithm based on training artificial neural networks for solving the leading eigenvalues and eigenfunctions of such high-dimensional eigenvalue problem. The algorithm is useful in understanding the dynamical behaviors of metastable processes on large timescales. We demonstrate the capability of our algorithm on a high-dimensional model problem, and on the simple molecular system alanine dipeptide.
We develop a data-driven method to learn chemical reaction networks from trajectory data. Modeling the reaction system as a continuous-time Markov chain and assuming the system is fully observed,our method learns the propensity functions of the system with predetermined basis functions by maximizing the likelihood function of the trajectory data under l^1 sparse regularization. We demonstrate our method with numerical examples using synthetic data and carry out an asymptotic analysis of the proposed learning procedure in the infinite-data limit.
In molecular dynamics and related fields one considers dynamical descriptions of complex systems in full (atomic) detail. In order to reduce the overwhelming complexity of realistic systems (high dimension, large timescale spread, limited computational resources) the projection of the full dynamics onto some reaction coordinates is examined in order to extract statistical information like free energies or reaction rates. In this context, the effective dynamics that is induced by the full dynamics on the reaction coordinate space has attracted considerable attention in the literature. In this article, we contribute to this discussion: We first show that if we start with an ergodic diffusion processes whose invariant measure is unique then these properties are inherited by the effective dynamics. Then, we give equations for the effective dynamics, discuss whether the dominant timescales and reaction rates inferred from the effective dynamics are accurate approximations of such quantities for the full dynamics, and compare our findings to results from approaches like Zwanzig-Mori, averaging, or homogenization. Finally, by discussing the algorithmic realization of the effective dynamics, we demonstrate that recent algorithmic techniques like the ”equation-free” approach and the ”heterogeneous multiscale method” can be seen as special cases of our approach.