## 68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)

### Refine

#### Document Type

- ZIB-Report (2)
- Article (1)

#### Keywords

- Convex Optimization (2)
- MSM (2)
- Reversible Markov Chain (2)
- Adaptive Importance Sampling (1)
- Girsanov (1)
- Metadynamics (1)
- Metastability (1)
- Molecular Dynamics (1)
- Non Equilibrium Sampling (1)
- Variance Reduction (1)

#### Institute

An automatic adaptive importance sampling algorithm for molecular dynamics in reaction coordinates
(2017)

In this article we propose an adaptive importance sampling scheme for dynamical quantities of high dimensional complex systems which are metastable. The main idea of this article is to combine a method coming from Molecular Dynamics Simulation, Metadynamics, with a theorem from stochastic analysis, Girsanov's theorem. The proposed algorithm has two advantages compared to a standard estimator of dynamic quantities: firstly, it is possible to produce estimators with a lower variance and, secondly, we can speed up the sampling. One of the main problems for building importance sampling schemes for metastable systems is to find the metastable region in order to manipulate the potential accordingly. Our method circumvents this problem by using an assimilated version of the Metadynamics algorithm and thus creates a non-equilibrium dynamics which is used to sample the equilibrium quantities.

Reversible Markov chains are the basis of many applications. However, computing transition probabilities by a finite sampling of a Markov chain can lead to truncation errors. Even if the original Markov chain is reversible, the approximated Markov chain might be non-reversible and will lose important properties, like the real valued spectrum. In this paper, we show how to find the closest reversible Markov chain to a given transition matrix. It turns out that this matrix can be computed by solving a convex minimization problem.