Refine
Year of publication
Document Type
- ZIB-Report (70)
- Article (1)
- Doctoral Thesis (1)
- Habilitation (1)
Language
- English (73)
Has Fulltext
- yes (73) (remove)
Is part of the Bibliography
- no (73)
Keywords
- metastability (7)
- 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)
- Model Selection, (2)
- NPMLE (2)
- Networks (2)
- Stochastic Block Model (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)
- metastable sets (2)
- molecular dynamics (2)
- non-equilibrium molecular dynamics (2)
- nonequilibrium molecular dynamics (2)
- optimal control (2)
- principle of maximum entropy (2)
- reference prior (2)
- stochastic 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)
- Ergodic diffusion (1)
- Floquet theory (1)
- Fokker--Planck equation (1)
- Galerkin method (1)
- Girsanov Theorem (1)
- Girsanov transformation (1)
- Ha (1)
- Hamiltonian dynamics (1)
- Hamiltonian system (1)
- IC_{50} (1)
- Importance Sampling (1)
- Importance sampling (1)
- Markov process (1)
- Markov state models (1)
- Markov states model (1)
- Markow State Methods (1)
- Mathematical modeling (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)
- Perron cluster an (1)
- Perron root (1)
- Perron- (1)
- QCMD (1)
- Real-time cell analyzer (1)
- Schrödinger equation (1)
- Schur decomposition (1)
- Smoluchowski dynamics (1)
- Smoluchowski equation (1)
- Stochastic Differential Equation (1)
- Toxicity (1)
- Transfer operator (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)
- importance sampling (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, network inference, time-evolving network, romanization spreading, scarce data (1)
- metadynamics (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)
- neural networks (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)
- rare event simulation (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)
- semigroup of Markov operators (1)
- sensitivity analysis (1)
- slow dynamics (1)
- small noise (1)
- stochastic approximation (1)
- stochastic chemical kinetics (1)
- stochastic optimal control (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)
- 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 (40)
- ZIB Allgemein (29)
- Modeling and Simulation of Complex Processes (9)
- Computational Systems Biology (5)
- Computational Molecular Design (2)
- Visual and Data-centric Computing (2)
- Bioinformatics in Medicine (1)
- Mathematics for Life and Materials Science (1)
- Visual Data Analysis (1)
We employ the adaptive resolution approach AdResS, in its recently developed Grand Canonicallike version (GC-AdResS) [Wang et al. Phys.Rev.X 3, 011018 (2013)], to calculate the excess chemical potential, $μ^{ex}$, of various liquids and mixtures. We compare our results with those obtained from full atomistic simulations using the technique of thermodynamic integration and show a satisfactory agreement. In GC-AdResS the procedure to calculate $μ^{ex}$ corresponds to the process of standard initial equilibration of the system; this implies that, independently of the specific aim of the study, $μ^{ex}$, for each molecular species, is automatically calculated every time a GC-AdResS simulation is performed.
We present a comprehensive theory for analysis and understanding of transition events between an initial set A and a target set B for general ergodic finite-state space Markov chains or jump processes, including random walks on networks as they occur, e.g., in Markov State Modelling in molecular dynamics. The theory allows us to decompose the probability flow generated by transition events between the sets A and B into the productive part that directly flows from A to B through reaction pathways and the unproductive part that runs in loops and is supported on cycles of the underlying network. It applies to random walks on directed networks and nonreversible Markov processes and can be seen as an extension of Transition Path Theory. Information on reaction pathways and unproductive cycles results from the stochastic cycle decomposition of the underlying network which also allows to compute their corresponding weight, thus characterizing completely which structure is used how often in transition events. The new theory is illustrated by an application to a Markov State Model resulting from weakly damped Langevin dynamics where the unproductive cycles are associated with periodic orbits of the underlying Hamiltonian dynamics.
We investigate the problem of finding modules (or clusters, communities) in directed networks. Until now, most articles on this topic have been oriented towards finding complete network partitions despite the fact that this often is unwanted. We present a novel random walk based approach for non-complete partitions of the directed network into modules in which some nodes do not belong to only one of the modules but to several or to none at all. The new random walk process is reversible even for directed networks but inherits all necessary information about directions and structure of the original network. We demonstrate the performance of the new method in application to a real-world earthquake network.
The identification of meaningful reaction coordinates plays a key role in the study of complex molecular systems whose essential dynamics is characterized by rare or slow transition events. In a recent publication, the authors identified a condition under which such reaction coordinates exist - the existence of a so-called transition manifold - and proposed a numerical method for their point-wise computation that relies on short bursts of MD simulations. This article represents an extension of the method towards practical applicability in computational chemistry. It describes an alternative computational scheme that instead relies on more commonly available types of simulation data, such as single long molecular trajectories, or the push-forward of arbitrary canonically-distributed point clouds. It is based on a Galerkin approximation of the transition manifold reaction coordinates, that can be tuned to individual requirements by the choice of the Galerkin ansatz functions. Moreover, we propose a ready-to-implement variant of the new scheme, that computes data-fitted, mesh-free ansatz functions directly from the available simulation data. The efficacy of the new method is demonstrated
on a realistic peptide system.
We consider complex dynamical systems showing metastable behavior but no local
separation of fast and slow time scales. The article raises the question of whether
such systems exhibit a low-dimensional manifold supporting its effective dynamics.
For answering this question, we aim at finding nonlinear coordinates, called reaction
coordinates, such that the projection of the dynamics onto these coordinates preserves
the dominant time scales of the dynamics. We show that, based on a specific
reducibility property, the existence of good low-dimensional reaction coordinates
preserving the dominant time scales is guaranteed. Based on this theoretical framework,
we develop and test a novel numerical approach for computing good reaction
coordinates. The proposed algorithmic approach is fully local and thus not prone to
the curse of dimension with respect to the state space of the dynamics. Hence, it is
a promising method for data-based model reduction of complex dynamical systems
such as molecular dynamics.
Model reduction of large Markov chains is an essential step in a wide array of techniques for understanding complex systems and for efficiently learning structures from high-dimensional data. We present a novel aggregation algorithm for compressing such chains that exploits a specific low-rank structure in the transition matrix which, e.g., is present in metastable systems, among others. It enables the recovery of the aggregates from a vastly undersampled transition matrix which in practical applications may gain a speedup of several orders of mag- nitude over methods that require the full transition matrix. Moreover, we show that the new technique is robust under perturbation of the transition matrix. The practical applicability of the new method is demonstrated by identifying a reduced model for the large-scale traffic flow patterns from real-world taxi trip data.
This paper presents a mathematical derivation of a model for quantum-classical molecular dynamics (QCMD) as a {\em partial} classical limit of the full Schrödinger equation. This limit is achieved in two steps: separation of the full wavefunction and short wave asymptotics for its ``classical'' part. Both steps can be rigorously justified under certain smallness assumptions. Moreover, the results imply that neither the time-dependent self-consistent field method nor mixed quantum-semi-classical models lead to better approximations than QCMD since they depend on the separation step, too. On the other hand, the theory leads to a characterization of the critical situations in which the models are in danger of largely deviating from the solution of the full Schrödinger equation. These critical situations are exemplified in an illustrative numerical simulation: the collinear collision of an Argon atom with a harmonic quantum oscillator.
The Car-Parrinello (CP) approach to ab initio molecular dynamics serves as an approximation to time-dependent Born-Oppenheimer (BO) calculations. It replaces the explicit minimization of the energy functional by a fictitious Newtonian dynamics and therefore introduces an artificial mass parameter $\mu$ which controls the electronic motion. A recent theoretical investigation shows that the CP-error, i.e., the deviation of the CP--solution from the BO-solution {\em decreases} like $\mu^{1/2}$ asymptotically. Since the computational effort {\em increases} like $\mu^{-1/2}$, the choice of $\mu$ has to find a compromise between efficiency and accuracy. The asymptotical result is used in this paper to construct an easily implemented algorithm which automatically controls $\mu$: the parameter $\mu$ is repeatedly adapted during the simulation by choosing $\mu$ as large as possible while pushing an error measure below a user-given tolerance. The performance and reliability of the algorithm is illustrated by a typical example.
The interaction potential of molecular systems which are typically used in molecular dynamics can be split into two parts of essentially different stiffness. The strong part of the potential forces the solution of the equations of motion to oscillate on a very small time scale. There is a strong need for eliminating the smallest time scales because they are a severe restriction for numerical long-term simulations of macromolecules. This leads to the idea of just freezing the high frequency degrees of freedom (bond stretching and bond angles). However, the naive way of doing this via holonomic constraints is bound to produce incorrect results. The paper presents a mathematically rigorous discussion of the limit situation in which the stiffness of the strong part of the potential is increased to infinity. It is demonstrated that the average of the limit solution indeed obeys a constrained Hamiltonian system but with a {\em corrected soft potential}. An explicit formula for the additive potential correction is given and its significant contribution is demonstrated in an illustrative example. It appears that this correcting potential is definitely not identical with the Fixman-potential as was repeatedly assumed in the literature.
\noindent In molecular dynamics applications there is a growing interest in so-called {\em mixed quantum-classical} models. These models describe most atoms of the molecular system by the means of classical mechanics but an important, small portion of the system by the means of quantum mechanics. A particularly extensively used model, the QCMD model, consists of a {\em singularly perturbed}\/ Schrödinger equation nonlinearly coupled to a classical Newtonian equation of motion. This paper studies the singular limit of the QCMD model for finite dimensional Hilbert spaces. The main result states that this limit is given by the time-dependent Born-Oppenheimer model of quantum theory---provided the Hamiltonian under consideration has a smooth spectral decomposition. This result is strongly related to the {\em quantum adiabatic theorem}. The proof uses the method of {\em weak convergence} by directly discussing the density matrix instead of the wave functions. This technique avoids the discussion of highly oscillatory phases. On the other hand, the limit of the QCMD model is of a different nature if the spectral decomposition of the Hamiltonian happens not to be smooth. We will present a generic example for which the limit set is not a unique trajectory of a limit dynamical system but rather a {\em funnel} consisting of infinitely many trajectories.