@misc{SchuetteHuisingaDeuflhard1999, author = {Sch{\"u}tte, Christof and Huisinga, Wilhelm and Deuflhard, Peter}, title = {Transfer Operator Approach to Conformational Dynamics in Biomolecular Systems}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4247}, number = {SC-99-36}, year = {1999}, abstract = {The article surveys the development of novel mathematical concepts and algorithmic approaches based thereon in view of their possible applicability to biomolecular design. Both a first deterministic approach, based on the Frobenius-Perron operator corresponding to the flow of the Hamiltonian dynamics, and later stochastic approaches, based on a spatial Markov operator or on Langevin dynamics, can be subsumed under the unified mathematical roof of the transfer operator approach to effective dynamics of molecular systems. The key idea of constructing specific transfer operators especially taylored for the purpose of conformational dynamics appears as the red line throughout the paper. Different steps of the algorithm are exemplified by a trinucleotide molecular system as a small representative of possible RNA drug molecules.}, language = {en} } @misc{DeuflhardHuisingaFischeretal.1998, author = {Deuflhard, Peter and Huisinga, Wilhelm and Fischer, Alexander and Sch{\"u}tte, Christof}, title = {Identification of Almost Invariant Aggregates in Reversible Nearly Uncoupled Markov Chains}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3469}, number = {SC-98-03}, year = {1998}, abstract = {The topic of the present paper bas been motivated by a recent computational approach to identify chemical conformations and conformational changes within molecular systems. After proper discretization, the conformations show up as almost invariant aggregates in reversible nearly uncoupled Markov chains. Most of the former work on this subject treated the direct problem: given the aggregates, analyze the loose coupling in connection with the computation of the stationary distribution (aggregation/disaggregation techniques). In contrast to that the present paper focuses on the inverse problem: given the system as a whole, identify the almost invariant aggregates together with the associated transition probabilites. A rather simple and robust algorithm is suggested and illustrated by its application to the n-pentane molecule.}, language = {en} } @misc{SchuetteFischerHuisingaetal.1998, author = {Sch{\"u}tte, Christof and Fischer, Alexander and Huisinga, Wilhelm and Deuflhard, Peter}, title = {A Hybrid Monte Carlo Method for Essential Molecular Dynamics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3474}, number = {SC-98-04}, year = {1998}, abstract = {Recently, a novel concept for the computation of essential features of Hamiltonian systems (such as those arising in molecular dynamics) has been proposed. The realization of that concept was based on subdivision techniques applied to the Frobenius--Perron operator for the dynamical system. The present paper suggests an alternative but related concept based on statistical mechanics, which allows to attack realistic molecular systems. In a first step, the frequency of conformational changes is characterized in statistical terms leading to the definition of some Markov operator \$T\$ that describes the corresponding transition probabilities within the canonical ensemble. In a second step, a discretization of \$T\$ via hybrid Monte Carlo techniques (based on short term subtrajectories only) is shown to lead to a stochastic matrix \$P\$. With these theoretical preparations, an identification algorithm for conformations is applicable (to be presented elsewhere). Numerical results for the n-pentane molecule are given and interpreted.}, language = {en} } @misc{WangHartmannSchuette2013, author = {Wang, Han and Hartmann, Carsten and Sch{\"u}tte, Christof}, title = {Linear response theory and optimal control for a molecular system under nonequilibrium conditions}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18944}, year = {2013}, abstract = {In this paper, we propose a straightforward generalization of linear response theory to systems in nonequilibrium that are subject to nonequilibrium driving. We briefly revisit the standard linear response result for equilibrium systems, where we consider Langevin dynamics as a special case, and then give an alternative derivation using a change-of-measure argument that does not rely on any stationarity or reversibility assumption. This procedure moreover easily enables us to calculate the second order correction to the linear response formula (which may or may not be useful in practice). Furthermore, we outline how the novel nonequilibirum linear response formula can be used to compute optimal controls of molecular systems for cases in which one wants to steer the system to maximize a certain target expectation value. We illustrate our approach with simple numerical examples.}, language = {en} } @inproceedings{DeuflhardSchuette2004, author = {Deuflhard, Peter and Sch{\"u}tte, Christof}, title = {Molecular Conformation Dynamics and Computational Drug Design}, booktitle = {Applied Mathematics Entering the 21st Century}, number = {116}, editor = {Hill, James and Moore, Ross}, publisher = {SIAM}, pages = {91 -- 119}, year = {2004}, language = {en} } @misc{DeuflhardSchuetteCordesetal.1999, author = {Deuflhard, Peter and Sch{\"u}tte, Christof and Cordes, Frank and M{\"u}ller-Kurth, L.}, title = {Konformationsdynamik. Mathematischer Entwurf hochspezifischer Biomolek{\"u}le}, publisher = {In: D. H{\"o}mberg (ed.), 8. Veranstaltungsreihe Forschungspolitische Dialoge in Berlin: Angewandte Mathematik - die verborgene Schl{\"u}sseltechnologie, 30. April 1999, Konrad-Zuse-Zentrum Berlin, pp. 30-34}, year = {1999}, language = {en} } @incollection{DeuflhardDellnitzJungeetal.1998, author = {Deuflhard, Peter and Dellnitz, M. and Junge, Oliver and Sch{\"u}tte, Christof}, title = {Computation of essential molecular dynamics by subdivision techniques}, volume = {4}, booktitle = {Computational molecular dynamics}, editor = {Deuflhard, Peter}, publisher = {Berlin: Springer.}, pages = {98 -- 115}, year = {1998}, language = {en} } @article{DeuflhardHuisingaFischeretal.2000, author = {Deuflhard, Peter and Huisinga, Wilhelm and Fischer, Alexander and Sch{\"u}tte, Christof}, title = {Identification of Almost Invariant Aggregates in Reversible Nearly Uncoupled Markov Chains}, volume = {315}, journal = {Lin. Alg. Appl.}, pages = {39 -- 59}, year = {2000}, language = {en} } @misc{HorenkoSchmidtEhrenbergSchuette2006, author = {Horenko, Illia and Schmidt-Ehrenberg, Johannes and Sch{\"u}tte, Christof}, title = {Set-oriented dimension reduction: Localizing principal component analysis via hidden Markov models}, volume = {4216}, journal = {Computational Life Sciences II}, publisher = {Springer}, pages = {98 -- 115}, year = {2006}, language = {en} } @misc{WillenbockelSchuette2015, author = {Willenbockel, Christian Tobias and Sch{\"u}tte, Christof}, title = {A Variational Bayesian Algorithm for Clustering of Large and Complex Networks}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-54588}, year = {2015}, abstract = {We propose the Blockloading algorithm for the clustering of large and complex graphs with tens of thousands of vertices according to a Stochastic Block Model (SBM). Blockloading is based on generalized Variational Bayesian EM (VBEM) schemes and works for weighted and unweighted graphs. Existing Variational (Bayesian) EM methods have to consider each possible number of clusters sepa- rately to determine the optimal number of clusters and are prone to converge to local optima making multiple restarts necessary. These factors impose a severe restriction on the size and complexity of graphs these methods can handle. In con- trast, the Blockloading algorithm restricts restarts to subnetworks in a way that provides error correction of an existing cluster assignment. The number of clusters need not be specified in advance because Blockloading will return it as a result. We show that Blockloading outperforms all other variational methods regarding reliability of the results and computational efficiency.}, language = {en} }