TY - JOUR A1 - Fackeldey, Konstantin A1 - Koltai, Peter A1 - Nevir, Peter A1 - Rust, Henning A1 - Schild, Axel A1 - Weber, Marcus T1 - From metastable to coherent sets - Time-discretization schemes JF - Chaos: An Interdisciplinary Journal of Nonlinear Science N2 - In this article, we show that these well-established spectral algorithms (like PCCA+, Perron Cluster Cluster Analysis) also identify coherent sets of non-autonomous dynamical systems. For the identification of coherent sets, one has to compute a discretization (a matrix T) of the transfer operator of the process using a space-time-discretization scheme. The article gives an overview about different time-discretization schemes and shows their applicability in two different fields of application. Y1 - 2019 U6 - https://doi.org/10.1063/1.5058128 VL - 29 SP - 012101 EP - 012101 ER - TY - THES A1 - Quer, Jannes T1 - Importance Sampling for metastable dynamical systems in molecular dynamics Y1 - 2018 ER - TY - GEN A1 - Bujotzek, Alexander A1 - Schütt, Ole A1 - Nielsen, Adam A1 - Fackeldey, Konstantin A1 - Weber, Marcus T1 - Efficient Conformational Analysis by Partition-of-Unity Coupling T2 - Math Chem N2 - Obtaining a sufficient sampling of conformational space is a common problem in molecular simulation. We present the implementation of an umbrella-like adaptive sampling approach based on function-based meshless discretization of conformational space that is compatible with state of the art molecular dynamics code and that integrates an eigenvector-based clustering approach for conformational analysis and the computation of inter-conformational transition rates. The approach is applied to three example systems, namely n-pentane, alanine dipeptide, and a small synthetic host-guest system, the latter two including explicitly modeled solvent. T3 - ZIB-Report - 13-58 KW - Markov State Models KW - Meshfree KW - Molecular Simulation KW - Partition of Unity Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-42570 SN - 1438-0064 ER - TY - GEN A1 - Weber, Marcus T1 - Eigenvalues of non-reversible Markov chains – A case study N2 - Finite reversible Markov chains are characterized by a transition matrix P that has real eigenvalues and pi-orthogonal eigenvectors, where pi is the stationary distribution of P. This means, that a transition matrix with complex eigenvalues corresponds to a non-reversible Markov chain. This observation leads to the question, whether the imaginary part of that eigendecomposition corresponds to or indicates the “pattern” of the nonreversibility. This article shows that the direct relation between imaginary parts of eigendecompositions and the non-reversibility of a transition matrix is not given. It is proposed to apply the Schur decomposition of P instead of the eigendecomposition in order to characterize its nonreversibility. T3 - ZIB-Report - 17-13 KW - non-reversible KW - transition matrix KW - detailed balance Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-62191 SN - 1438-0064 ER - TY - JOUR A1 - Hartmann, Carsten A1 - Schütte, Christof A1 - Weber, Marcus A1 - Zhang, Wei T1 - Importance sampling in path space for diffusion processes with slow-fast variables JF - Probability Theory and Related Fields N2 - Importance sampling is a widely used technique to reduce the variance of a Monte Carlo estimator by an appropriate change of measure. In this work, we study importance sampling in the framework of diffusion process and consider the change of measure which is realized by adding a control force to the original dynamics. For certain exponential type expectation, the corresponding control force of the optimal change of measure leads to a zero-variance estimator and is related to the solution of a Hamilton–Jacobi–Bellmann equation. We focus on certain diffusions with both slow and fast variables, and the main result is that we obtain an upper bound of the relative error for the importance sampling estimators with control obtained from the limiting dynamics. We demonstrate our approximation strategy with an illustrative numerical example. Y1 - 2017 UR - http://rdcu.be/oA51 U6 - https://doi.org/10.1007/s00440-017-0755-3 N1 - If you are not subscribing to the journal please use the http link below as part of the Springer Nature SharedIt initiative SP - 1 EP - 52 ER - TY - GEN A1 - Nielsen, Adam T1 - The Monte Carlo Computation Error of Transition Probabilities N2 - In many applications one is interested to compute transition probabilities of a Markov chain. This can be achieved by using Monte Carlo methods with local or global sampling points. In this article, we analyze the error by the difference in the $L^2$ norm between the true transition probabilities and the approximation achieved through a Monte Carlo method. We give a formula for the error for Markov chains with locally computed sampling points. Further, in the case of reversible Markov chains, we will deduce a formula for the error when sampling points are computed globally. We will see that in both cases the error itself can be approximated with Monte Carlo methods. As a consequence of the result, we will derive surprising properties of reversible Markov chains. T3 - ZIB-Report - 16-37 KW - Reversible Markov chain KW - Monte Carlo methods KW - Computation error KW - Measurable state space KW - Markov operator Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-59933 SN - 1438-0064 ER - TY - JOUR A1 - Nielsen, Adam T1 - The Monte Carlo Computation Error of Transition Probabilities JF - Statistics & Probability Letters N2 - In many applications one is interested to compute transition probabilities of a Markov chain. This can be achieved by using Monte Carlo methods with local or global sampling points. In this article, we analyze the error by the difference in the $L^2$ norm between the true transition probabilities and the approximation achieved through a Monte Carlo method. We give a formula for the error for Markov chains with locally computed sampling points. Further, in the case of reversible Markov chains, we will deduce a formula for the error when sampling points are computed globally. We will see that in both cases the error itself can be approximated with Monte Carlo methods. As a consequence of the result, we will derive surprising properties of reversible Markov chains. Y1 - 2016 U6 - https://doi.org/10.1016/j.spl.2016.06.011 VL - 118 SP - 163 EP - 170 PB - Elsevier ER - TY - JOUR A1 - Quer, Jannes A1 - Donati, Luca A1 - Keller, Bettina A1 - Weber, Marcus T1 - An automatic adaptive importance sampling algorithm for molecular dynamics in reaction coordinates JF - SIAM Journal on Scientific Computing N2 - 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. Y1 - 2018 U6 - https://doi.org/10.1137/17m1124772 VL - 40 IS - 2 SP - A653 EP - A670 ER - TY - GEN A1 - Weber, Marcus T1 - Supplementary: Implications of PCCA+ in Molecular Simulation N2 - Matlab-software and data sets to recapitulate the presented results in M. Weber: Implications of PCCA+ in Molecular Simulation. Computation, 6(1):20, 2018. Y1 - 2018 N1 - This data set includes one folder per published figure. The folders contain all needed resources to recapitulate the presented results. ER - TY - JOUR A1 - Weber, Marcus T1 - Implications of PCCA+ in Molecular Simulation JF - Computation N2 - Upon ligand binding or during chemical reactions the state of a molecular system changes in time. Usually we consider a finite set of (macro-) states of the system (e.g., ’bound’ vs. ’unbound’), although the process itself takes place in a continuous space. In this context, the formula chi=XA connects the micro-dynamics of the molecular system to its macro-dynamics. Chi can be understood as a clustering of micro-states of a molecular system into a few macro-states. X is a basis of an invariant subspace of a transfer operator describing the micro-dynamics of the system. The formula claims that there is an unknown linear relation A between these two objects. With the aid of this formula we can understand rebinding effects, the electron flux in pericyclic reactions, and systematic changes of binding rates in kinetic ITC experiments. We can also analyze sequential spectroscopy experiments and rare event systems more easily. This article provides an explanation of the formula and an overview of some of its consequences. Y1 - 2018 U6 - https://doi.org/10.3390/computation6010020 VL - 6 IS - 1 SP - 20 ER - TY - JOUR A1 - Zhang, Wei A1 - Wang, Han A1 - Hartmann, Carsten A1 - Weber, Marcus A1 - Schütte, Christof T1 - Applications of the cross-entropy method to importance sampling and optimal control of diffusions JF - Siam Journal on Scientific Computing Y1 - 2014 U6 - https://doi.org/10.1137/14096493X VL - 36 IS - 6 SP - A2654 EP - A2672 ER - TY - JOUR A1 - Schütte, Christof A1 - Nielsen, Adam A1 - Weber, Marcus T1 - Markov State Models and Molecular Alchemy JF - Molecular Physics N2 - In recent years Markov State Models (MSMs) have attracted a consid- erable amount of attention with regard to modelling conformation changes and associated function of biomolecular systems. They have been used successfully, e.g., for peptides including time-resolved spectroscopic experiments, protein function and protein folding , DNA and RNA, and ligand-receptor interaction in drug design and more complicated multivalent scenarios. In this article a novel reweighting scheme is introduced that allows to construct an MSM for certain molecular system out of an MSM for a similar system. This permits studying how molecular properties on long timescales differ between similar molecular systems without performing full molecular dynamics simulations for each system under con- sideration. The performance of the reweighting scheme is illustrated for simple test cases including one where the main wells of the respective energy landscapes are located differently and an alchemical transformation of butane to pentane where the dimension of the state space is changed. KW - MSM KW - Reweighting KW - Girsanov Y1 - 2015 U6 - https://doi.org/10.1080/00268976.2014.944597 VL - 113 IS - 1 SP - 69 EP - 78 ER - TY - THES A1 - Lie, Han Cheng T1 - A Meshless Method for Conformational Analysis Y1 - 2012 ER - TY - JOUR A1 - Nielsen, Adam A1 - Weber, Marcus T1 - Computing the nearest reversible Markov chain JF - Numerical Linear Algebra with Applications N2 - 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. KW - Reversible Markov Chain KW - Convex Optimization KW - MSM Y1 - 2015 U6 - https://doi.org/10.1002/nla.1967 VL - 22 IS - 3 SP - 483 EP - 499 ER - TY - JOUR A1 - Weber, Marcus A1 - Fackeldey, Konstantin A1 - Schütte, Christof T1 - Set-Free Markov State Model Building JF - Journal of Chemical Physics Y1 - 2017 U6 - https://doi.org/10.1063/1.4978501 VL - 146 IS - 12 ER - TY - JOUR A1 - Quer, Jannes A1 - Lie, Han Cheng T1 - Some connections between importance sampling and enhanced sampling methods in molecular dynamics JF - Journal of Chemical Physics N2 - Enhanced sampling methods play an important role in molecular dynamics, because they enable the collection of better statistics of rare events that are important in many physical phenomena. We show that many enhanced sampling methods can be viewed as methods for performing importance sampling, by identifying important correspondences between the language of molecular dynamics and the language of probability theory. We illustrate these connections by highlighting the similarities between the rare event simulation method of Hartmann and Schütte (J. Stat. Mech. Theor. Exp., 2012), and the enhanced sampling method of Valsson and Parrinello (Phys. Rev. Lett. 113, 090601). We show that the idea of changing a probability measure is fundamental to both enhanced sampling and importance sampling. Y1 - 2017 ER - TY - JOUR A1 - Fackeldey, Konstantin A1 - Niknejad, Amir A1 - Weber, Marcus T1 - Finding Metastabilities in Reversible Markov Chains based on Incomplete Sampling: Case of Molecular Simulation JF - Special Matrices Y1 - 2017 U6 - https://doi.org/10.1515/spma-2017-0006 IS - 5/1 SP - 73 EP - 81 ER - TY - JOUR A1 - Fackeldey, Konstantin A1 - Weber, Marcus T1 - GenPCCA -- Markov State Models for Non-Equilibrium Steady States JF - Big data clustering: Data preprocessing, variable selection, and dimension reduction. WIAS Report No. 29 Y1 - 2017 U6 - https://doi.org/10.20347/WIAS.REPORT.29 SP - 70 EP - 80 ER - TY - GEN A1 - Weber, Marcus A1 - Quer, Jannes T1 - Estimating exit rates in rare event dynamical systems via extrapolation N2 - In this article we present a new idea for approximating exit rates for diffusion processes living in a craggy landscape. We are especially interested in the exit rates of a process living in a metastable regions. Due to the fact that Monte Carlo simulations perform quite poor and are very computational expensive in this setting we create several similar situations with a smoothed potential. For this we introduce a new parameter $\lambda \in [0,1]$ ($\lambda = 1$ very smoothed potential, $\lambda=0$ original potential) into the potential which controls the influence the smoothing. We then sample the exit rate for different parameters $\lambda$ the exit rate from a given region. Due to the fact that $\lambda$ is connected to the exit rate we can use this dependency to approximate the real exit rate. The method can be seen as something between hyperdynamics and temperature accelerated MC. T3 - ZIB-Report - 15-54 KW - rare event sampling, smoothing, membership functions, perturbed potential Y1 - 2015 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-56622 SN - 1438-0064 ER - TY - JOUR A1 - Bujotzek, Alexander A1 - Schütt, Ole A1 - Nielsen, Adam A1 - Fackeldey, Konstantin A1 - Weber, Marcus T1 - ZIBgridfree: Efficient Conformational Analysis by Partition-of-Unity Coupling JF - Journal of Mathematical Chemistry Y1 - 2014 U6 - https://doi.org/10.1007/s10910-013-0265-1 VL - 52 IS - 3 SP - 781 EP - 804 ER - TY - GEN A1 - Fackeldey, Konstantin A1 - Koltai, Péter A1 - Névir, Peter A1 - Rust, Henning A1 - Schild, Axel A1 - Weber, Marcus T1 - From Metastable to Coherent Sets - time-discretization schemes N2 - Given a time-dependent stochastic process with trajectories x(t) in a space $\Omega$, there may be sets such that the corresponding trajectories only very rarely cross the boundaries of these sets. We can analyze such a process in terms of metastability or coherence. Metastable sets M are defined in space $M\subset\Omega$, coherent sets $M(t)\subset\Omega$ are defined in space and time. Hence, if we extend the space by the time-variable t, coherent sets are metastable sets in $\Omega\times[0,\infty]$. This relation can be exploited, because there already exist spectral algorithms for the identification of metastable sets. In this article we show that these well-established spectral algorithms (like PCCA+) also identify coherent sets of non-autonomous dynamical systems. For the identification of coherent sets, one has to compute a discretization (a matrix T) of the transfer operator of the process using a space-timediscretization scheme. The article gives an overview about different time-discretization schemes and shows their applicability in two different fields of application. T3 - ZIB-Report - 17-74 Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-66074 SN - 1438-0064 ER - TY - JOUR A1 - Heida, Martin A1 - Sikorski, Alexander A1 - Weber, Marcus T1 - Consistency and order 1 convergence of cell-centered finite volume discretizations of degenerate elliptic problems in any space dimension JF - SIAM Journal on Numerical Analysis N2 - We study consistency of cell-centered finite difference methods for elliptic equations with degenerate coefficients in any space dimension $d \geq 2$. This results in order of convergence estimates in the natural weighted energy norm and in the weighted discrete $L^2$-norm on admissible meshes. The cells of meshes under consideration may be very irregular in size. We particularly allow the size of certain cells to remain bounded from below even in the asymptotic limit. For uniform meshes we show that the order of convergence is at least 1 in the energy semi-norm, provided the discrete and continuous solutions exist and the continuous solution has $H^2$ regularity. Y1 - 2022 U6 - https://doi.org/10.20347/WIAS.PREPRINT.2913 ER - TY - JOUR A1 - Sechi, Renata A1 - Weber, Marcus A1 - Heyne, Karsten T1 - MSM building and projection for the analysis of time-resolved spectra JF - Proceedings in Applied Mathematics and Mechanics N2 - Understanding the kinetics between the components of time-resolved spectra is a crucial step in the study of photo-activatedprocesses. However, modeling the kinetics requires usually some a priori knowledge about the system. In our approach, webuild a Markov State Model (MSM) from the spectral data, and obtain a Koopman transition matrix K(t). With genPCCA,an invariant subspace projection, we project the process into its metastable components. The result of the application of gen-PCCA is a transition matrix Kc(t), from which we can read the transition probability between the metastable components of the reaction. We discuss the application of this analysis method to the transient absorption spectrum of brominated Al-corrole Y1 - 2021 U6 - http://nbn-resolving.de/urn/resolver.pl?https://onlinelibrary.wiley.com/doi/10.1002/pamm.202100102 IS - 21 SP - e202100102 ER -