Refine
Year of publication
- 2021 (11) (remove)
Document Type
- Article (9)
- ZIB-Report (1)
- Research data (1)
Is part of the Bibliography
- no (11)
The Augmented Jump Chain
(2021)
Modern methods of simulating molecular systems are based on the mathematical theory of Markov operators with a focus on autonomous equilibrated systems. However, non-autonomous physical systems or non-autonomous simulation processes are becoming more and more important. A representation of non-autonomous Markov jump processes is presented as autonomous Markov chains on space-time. Augmenting the spatial information of the embedded Markov chain by the temporal information of the associated jump times, the so-called augmented jump chain is derived. The augmented jump chain inherits the sparseness of the infinitesimal generator of the original process and therefore provides a useful tool for studying time-dependent dynamics even in high dimensions. Furthermore, possible generalizations and applications to the computation of committor functions and coherent sets in the non-autonomous setting are discussed. After deriving the theoretical foundations, the concepts with a proof-of-concept Galerkin discretization of the transfer operator of the augmented jump chain applied to simple examples are illustrated.
Plasma Proteome Fingerprints Reveal Distinctiveness and Clinical Outcome of SARS-CoV-2 Infection
(2021)
We evaluated how plasma proteomic signatures in patients with suspected COVID-19 can unravel the pathophysiology, and determine kinetics and clinical outcome of the infection. We identified distinct plasma proteins linked to the presence and course of COVID-19. These plasma proteomic findings may translate to a protein fingerprint, helping to assist clinical management decisions.
Molecular dynamics (MD) are extremely complex, yet understanding the slow components of their dynamics is essential to understanding their macroscopic properties. To achieve this, one models the MD as a stochastic process and analyses the dominant eigenfunctions of the associated Fokker–Planck operator, or of closely related transfer operators. So far, the calculation of the discretized operators requires extensive MD simulations. The square-root approximation of the Fokker–Planck equation is a method to calculate transition rates as a ratio of the Boltzmann densities of neighboring grid cells times a flux, and can in principle be calculated without a simulation. In a previous work we still used MD simulations to determine the flux. Here, we propose several methods to calculate the exact or approximate flux for various grid types, and thus estimate the rate matrix without a simulation. Using model potentials we test computational efficiency of the methods, and the accuracy with which they reproduce the dominant eigenfunctions and eigenvalues. For these model potentials, rate matrices with up to $\mathcal{O}\left(1{0}^{6}\right)$ states can be obtained within seconds on a single high-performance compute server if regular grids are used.
The aim of this paper is to investigate the rebinding effect, a phenomenon describing a "short-time memory" which can occur when projecting a Markov process onto a smaller state space. For guaranteeing a correct mapping by the Markov State Model, we assume a fuzzy clustering in terms of membership functions, assigning degrees of membership to each state. The macro states are represented by the membership functions and may be overlapping. The magnitude of this overlap is a measure for the strength of the rebinding effect, caused by the projection and stabilizing the system. A minimal bound for the rebinding effect included in a given system is computed as the solution of an optimization problem. Based on membership functions chosen as a linear combination of Schur vectors, this generalized approach includes reversible as well as non-reversible processes.
Raman spectroscopy is a well established tool for the analysis of vibration spectra, which then allow for the determination of individual substances in a chemical sample, or for their phase transitions. In the Time-Resolved-Raman-Sprectroscopy the vibration spectra of a chemical sample are recorded sequentially over a time interval, such that conclusions for intermediate products (transients) can be drawn within a chemical process. The observed data-matrix M from a Raman spectroscopy can be regarded as a matrix product of two unknown matrices W and H, where the first is representing the contribution of the spectra and the latter represents the chemical spectra. One approach for obtaining W and H is the non-negative matrix factorization. We propose a novel approach, which does not need the commonly used separability assumption. The performance of this approach is shown on a real world chemical example.
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
This article addresses the problem of estimating the Koopman generator of a Markov process. The direct computation of the infinitesimal generator is not easy because of the discretization of the state space, in particular because of the trade-off inherent in the choice of the best lag time to study the process. Short lag times implies a strong discretization of the state space and a consequent loss of Markovianity. Large lag times bypass events on fast timescales. We propose a method to approximate the generator with the computation of the Newton polynomial extrapolation. This technique is a multistep approach which uses as its input Koopman transfer operators evaluated for a series of lag times. Thus, the estimated infinitesimal generator combines information from different time resolutions and does not bias only fast- or slow-decaying dynamics. We show that the multi-scale Newton method can improve the estimation of the generator in comparison to the computation using finite difference or matrix logarithm methods.
In this paper, we explore the relationship patterns between Ancient Egyptian texts of the corpus ``Synodal decrees'', which are originating between 243 and 185 BCE, during the Ptolemaic period. Particularly, we are interested in analyzing the grammatical features of the different texts. Conventional data analysis methods such as correspondence Analysis are very useful to explore the patterns of statistical interdependence between categories of variables. However, it is based on a PCA-like dimension-reduction method and turned out to be unsuitable for our dataset due to the high dimensionality of our data representations. Additionally, the similarity between pairs of texts and pairs of grammatical features is observed through the distance between their representation, but the degree of association between a particular grammatical feature and a text is not. Here, we applied a qualitative Euclidean embedding method that provides a new Euclidean representation of the categories of variables. This new representation of the categories is constructed in such a way that all the patterns of statistical interdependence, similarity, and association, are seen through the Euclidean distance between them. Nevertheless, the PCA-like dimension-reduction method also performed poorly on our new representation. Therefore, we obtained a two-dimensional visualization using non-linear methods such UMAP or t-SNE. Although these dimension-reduction methods reduced the interpretability of interpoint distances, we were still able to identify important similarity patterns between the Synodal text as well as their association patterns with the grammatical features.