@misc{WeberFackeldey2013, author = {Weber, Marcus and Fackeldey, Konstantin}, title = {Computing the Minimal Rebinding Effect Included in a Given Kinetics}, issn = {1438-0064}, doi = {10.1137/13091124X}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-17796}, year = {2013}, abstract = {The rebinding effect is a phenomenon which occurs when observing a ligand-receptor binding process. On the macro scale this process comprises the Markov property. This Makovian view is spoiled when switching to the atomistic scale of a binding process. We therefore suggest a model which accurately describes the rebinding effect on the atomistic scale by allowing ''intermediate'' bound states. This allows us to define an indicator for the magnitude of rebinding and to formulate an optimization problem. The results form our examples show good agreement with data form laboratory.}, language = {en} } @misc{LieFackeldeyWeber2013, author = {Lie, Han Cheng and Fackeldey, Konstantin and Weber, Marcus}, title = {A square root approximation of transition rates for a Markov State Model}, issn = {1438-0064}, doi = {10.1137/120899959}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-42195}, year = {2013}, abstract = {Trajectory- or mesh-based methods for analyzing the dynamical behavior of large molecules tend to be impractical due to the curse of dimensionality - their computational cost increases exponentially with the size of the molecule. We propose a method to break the curse by a novel square root approximation of transition rates, Monte Carlo quadrature and a discretization approach based on solving linear programs. With randomly sampled points on the molecular energy landscape and randomly generated discretizations of the molecular configuration space as our initial data, we construct a matrix describing the transition rates between adjacent discretization regions. This transition rate matrix yields a Markov State Model of the molecular dynamics. We use Perron cluster analysis and coarse-graining techniques in order to identify metastable sets in configuration space and approximate the transition rates between the metastable sets. Application of our method to a simple energy landscape on a two-dimensional configuration space provides proof of concept and an example for which we compare the performance of different discretizations. We show that the computational cost of our method grows only polynomially with the size of the molecule. However, finding discretizations of higher-dimensional configuration spaces in which metastable sets can be identified remains a challenge.}, language = {en} } @misc{NielsenFackeldeyWeber2013, author = {Nielsen, Adam and Fackeldey, Konstantin and Weber, Marcus}, title = {On a Generalized Transfer Operator}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-43162}, year = {2013}, abstract = {We introduce a generalized operator for arbitrary stochastic processes by using a pre-kernel, which is a generalization of the Markov kernel. For deterministic processes, such an operator is already known as the Frobenius-Perron operator, which is defined for a large class of measures. For Markov processes, there exists transfer operators being only well defined for stationary measures in \$L^2\$. Our novel generalized transfer operator is well defined for arbitrary stochastic processes, in particular also for deterministic ones. We can show that this operator is acting on \$L^1\$. For stationary measures, this operator is also an endomorphism of \$L^2\$ and, therefore, allows for a mathematical analysis in Hilbert spaces.}, language = {en} } @article{LieFackeldeyWeber2013, author = {Lie, Han Cheng and Fackeldey, Konstantin and Weber, Marcus}, title = {A Square Root Approximation of Transition Rates for a Markov State Model}, volume = {34}, journal = {SIAM. J. Matrix Anal. Appl.}, number = {2}, doi = {10.1137/120899959}, pages = {738 -- 756}, year = {2013}, language = {en} } @misc{BujotzekSchuettNielsenetal.2013, author = {Bujotzek, Alexander and Sch{\"u}tt, Ole and Nielsen, Adam and Fackeldey, Konstantin and Weber, Marcus}, title = {Efficient Conformational Analysis by Partition-of-Unity Coupling}, journal = {Math Chem}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-42570}, year = {2013}, abstract = {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.}, language = {en} } @article{RoeblitzWeber2013, author = {R{\"o}blitz, Susanna and Weber, Marcus}, title = {Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification}, volume = {7}, journal = {Advances in Data Analysis and Classification}, number = {2}, doi = {10.1007/s11634-013-0134-6}, pages = {147 -- 179}, year = {2013}, language = {en} } @article{HaackFackeldeyRoeblitzetal.2013, author = {Haack, Fiete and Fackeldey, Konstantin and R{\"o}blitz, Susanna and Scharkoi, Olga and Weber, Marcus and Schmidt, Burkhard}, title = {Adaptive spectral clustering with application to tripeptide conformation analysis}, volume = {139}, journal = {The Journal of Chemical Physics}, doi = {10.1063/1.4830409}, pages = {110 -- 194}, year = {2013}, language = {en} } @misc{Nielsen2012, type = {Master Thesis}, author = {Nielsen, Adam}, title = {Von Femtosekunden zu Minuten}, pages = {107}, year = {2012}, language = {de} } @misc{Nielsen2016, author = {Nielsen, Adam}, title = {The Monte Carlo Computation Error of Transition Probabilities}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-59933}, year = {2016}, abstract = {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.}, language = {en} } @article{Nielsen2016, author = {Nielsen, Adam}, title = {The Monte Carlo Computation Error of Transition Probabilities}, volume = {118}, journal = {Statistics \& Probability Letters}, publisher = {Elsevier}, doi = {10.1016/j.spl.2016.06.011}, pages = {163 -- 170}, year = {2016}, abstract = {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.}, language = {en} } @masterthesis{Roehl2015, type = {Bachelor Thesis}, author = {R{\"o}hl, Susanne}, title = {Kondition des Eigenwertproblems von Markov-Ketten}, year = {2015}, language = {de} } @misc{DjurdjevacConradWeberSchuette2015, author = {Djurdjevac Conrad, Natasa and Weber, Marcus and Sch{\"u}tte, Christof}, title = {Finding dominant structures of nonreversible Markov processes}, issn = {1438-0064}, doi = {10.1137/15M1032272}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-55739}, year = {2015}, abstract = {Finding metastable sets as dominant structures of Markov processes has been shown to be especially useful in modeling interesting slow dynamics of various real world complex processes. Furthermore, coarse graining of such processes based on their dominant structures leads to better understanding and dimension reduction of observed systems. However, in many cases, e.g. for nonreversible Markov processes, dominant structures are often not formed by metastable sets but by important cycles or mixture of both. This paper aims at understanding and identifying these different types of dominant structures for reversible as well as nonreversible ergodic Markov processes. Our algorithmic approach generalizes spectral based methods for reversible process by using Schur decomposition techniques which can tackle also nonreversible cases. We illustrate the mathematical construction of our new approach by numerical experiments.}, language = {en} } @misc{SarichSchuette2014, author = {Sarich, Marco and Sch{\"u}tte, Christof}, title = {Markov Model Theory}, volume = {797}, journal = {An Introduction to Markov State Models and Their Application to Long Timescale Molecular Simulation}, editor = {Bowman, Gregory R. and Pande, Vijay S. and No{\´e}, Frank}, publisher = {Springer}, doi = {10.1007/978-94-007-7606-7}, pages = {23 -- 44}, year = {2014}, abstract = {This section reviews the relation between the continuous dynamics of a molecular system in thermal equilibrium and the kinetics given by a Markov State Model (MSM). We will introduce the dynamical propagator, an error-less, alternative description of the continuous dynamics, and show how MSMs result from its discretization. This allows for an precise understanding of the approximation quality of MSMs in comparison to the continuous dynamics. The results on the approximation quality are key for the design of good MSMs. While this section is important for understanding the theory of discretization and related systematic errors, practitioners wishing only to learn how to construct MSMs may skip directly to the discussion of Markov model estimation.}, language = {en} } @article{SchuetteNielsenWeber2015, author = {Sch{\"u}tte, Christof and Nielsen, Adam and Weber, Marcus}, title = {Markov State Models and Molecular Alchemy}, volume = {113}, journal = {Molecular Physics}, number = {1}, doi = {10.1080/00268976.2014.944597}, pages = {69 -- 78}, year = {2015}, abstract = {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.}, language = {en} } @article{WeberFackeldey2014, author = {Weber, Marcus and Fackeldey, Konstantin}, title = {Computing the Minimal Rebinding Effect Included in a Given Kinetics}, volume = {12}, journal = {Multiscale Model. Simul.}, number = {1}, doi = {10.1137/13091124X}, pages = {318 -- 334}, year = {2014}, abstract = {The rebinding effect is a phenomenon which occurs when observing a ligand-receptor binding process. On the macro scale this process comprises the Markov property. This Makovian view is spoiled when switching to the atomistic scale of a binding process. We therefore suggest a model which accurately describes the rebinding effect on the atomistic scale by allowing ''intermediate'' bound states. This allows us to define an indicator for the magnitude of rebinding and to formulate an optimization problem. The results form our examples show good agreement with data form laboratory.}, language = {en} } @misc{NielsenWeber2014, author = {Nielsen, Adam and Weber, Marcus}, title = {Computing the nearest reversible Markov chain}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-53292}, year = {2014}, abstract = {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.}, language = {en} } @article{NielsenWeber2015, author = {Nielsen, Adam and Weber, Marcus}, title = {Computing the nearest reversible Markov chain}, volume = {22}, journal = {Numerical Linear Algebra with Applications}, number = {3}, doi = {10.1002/nla.1967}, pages = {483 -- 499}, year = {2015}, abstract = {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.}, language = {en} } @misc{SchuetteDeuflhardNoeetal.2014, author = {Sch{\"u}tte, Christof and Deuflhard, Peter and No{\´e}, Frank and Weber, Marcus}, title = {Design of functional molecules}, volume = {1}, journal = {MATHEON-Mathematics for Key Technologies}, editor = {Deuflhard, Peter and Gr{\"o}tschel, Martin and H{\"o}mberg, Dietmar and Horst, Ulrich and Kramer, J{\"u}rg and Mehrmann, Volker and Polthier, Konrad and Schmidt, Frank and Sch{\"u}tte, Christof and Skutella, Martin and Sprekels, J{\"u}rgen}, publisher = {European Mathematical Society}, pages = {49 -- 65}, year = {2014}, language = {en} } @article{BujotzekSchuettNielsenetal.2014, author = {Bujotzek, Alexander and Sch{\"u}tt, Ole and Nielsen, Adam and Fackeldey, Konstantin and Weber, Marcus}, title = {ZIBgridfree: Efficient Conformational Analysis by Partition-of-Unity Coupling}, volume = {52}, journal = {Journal of Mathematical Chemistry}, number = {3}, doi = {10.1007/s10910-013-0265-1}, pages = {781 -- 804}, year = {2014}, language = {de} } @article{Weber2013, author = {Weber, Marcus}, title = {Adaptive Spectral Clustering in Molecular Simulation. In: Studies in Classification, Data Analysis, and Knowledge Organization}, journal = {XIV: Classification and Data Mining, A. Giusti, G. Ritter, M. Vichi (Eds.), Springer Series}, pages = {147 -- 157}, year = {2013}, language = {de} } @article{DjurdjevacConradWeberSchuette2016, author = {Djurdjevac Conrad, Natasa and Weber, Marcus and Sch{\"u}tte, Christof}, title = {Finding dominant structures of nonreversible Markov processes}, volume = {14}, journal = {Multiscale Modeling and Simulation}, number = {4}, doi = {10.1137/15M1032272}, pages = {1319 -- 1340}, year = {2016}, language = {en} } @phdthesis{Nielsen2016, author = {Nielsen, Adam}, title = {Computation Schemes for Transfer Operators}, year = {2016}, language = {en} }