Searcharxiv⌕ Search

arXiv subjects

Christof Schütte

Publications and source records attributed to Christof Schütte.

At least 37 records · Page 2Linked to original sources

Understanding recent deep-learning techniques for identifying collective variables of molecular dynamics

High-dimensional metastable molecular system can often be characterised by a few features of the system, i.e. collective variables (CVs). Thanks to the rapid advance in the area of machine learning and deep learning, various deep learning-based CV identification techniques have been developed in recent years, allowing accurate modelling and efficient simulation of complex molecular systems. In this paper, we look at two different categories of deep learning-based approaches for finding CVs, either by computing leading eigenfunctions of infinitesimal generator or transfer operator associated to the underlying dynamics, or by learning an autoencoder via minimisation of reconstruction error. We present a concise overview of the mathematics behind these two approaches and conduct a comparative numerical study of these two approaches on illustrative examples.

cs.LG↗

Partial mean-field model for neurotransmission dynamics

This article addresses reaction networks in which spatial and stochastic effects are of crucial importance. For such systems, particle-based models allow us to describe all microscopic details with high accuracy. However, they suffer from computational inefficiency if particle numbers and density get too large. Alternative coarse-grained-resolution models reduce computational effort tremendously, e.g., by replacing the particle distribution by a continuous concentration field governed by reaction-diffusion PDEs. We demonstrate how models on the different resolution levels can be combined into hybrid models that seamlessly combine the best of both worlds, describing molecular species with large copy numbers by macroscopic equations with spatial resolution while keeping the stochastic-spatial particle-based resolution level for the species with low copy numbers. To this end, we introduce a simple particle-based model for the binding dynamics of ions and vesicles at the heart of the neurotransmission process. Within this framework, we derive a novel hybrid model and present results from numerical experiments which demonstrate that the hybrid model allows for an accurate approximation of the full particle-based model in realistic scenarios.

physics.bio-ph↗

Impact Study of Numerical Discretization Accuracy on Parameter Reconstructions and Model Parameter Distributions

In optical nano metrology numerical models are used widely for parameter reconstructions. Using the Bayesian target vector optimization method we fit a finite element numerical model to a Grazing Incidence X-Ray fluorescence data set in order to obtain the geometrical parameters of a nano structured line grating. Gaussian process, stochastic machine learning surrogate models, were trained during the reconstruction and afterwards sampled with a Markov chain Monte Carlo sampler to determine the distribution of the reconstructed model parameters. The numerical discretization parameters of the used finite element model impact the numerical discretization error of the forward model. We investigated the impact of the polynomial order of the finite element ansatz functions on the reconstructed parameters as well as on the model parameter distributions. We showed that such a convergence study allows to determine numerical parameters which allows for efficient and accurate reconstruction results.

physics.comp-ph↗

Rate-limiting recovery processes in neurotransmission under sustained stimulation

At chemical synapses, an arriving electric signal induces the fusion of vesicles with the presynaptic membrane, thereby releasing neurotransmitters into the synaptic cleft. After a fusion event, both the release site and the vesicle undergo a recovery process before becoming available for reuse again. Of central interest is the question which of the two restoration steps acts as the limiting factor during neurotransmission under high-frequency sustained stimulation. In order to investigate this question, we introduce a novel non-linear reaction network which involves explicit recovery steps for both the vesicles and the release sites, and includes the induced time-dependent output current. The associated reaction dynamics are formulated by means of ordinary differential equations (ODEs), as well as via the associated stochastic jump process. While the stochastic jump model describes a single release site, the average over many release sites is close to the ODE solution and shares its periodic structure. The reason for this can be traced back to the insight that recovery dynamics of vesicles and release sites are statistically almost independent. A sensitivity analysis on the recovery rates based on the ODE formulation reveals that neither the vesicle nor the release site recovery step can be identified as the essential rate-limiting step but that the rate-limiting feature changes over the course of stimulation. Under sustained stimulation the dynamics given by the ODEs exhibit transient changes leading from an initial depression of the postsynaptic response to an asymptotic periodic orbit, while the individual trajectories of the stochastic jump model lack the oscillatory behavior and asymptotic periodicity of the ODE-solution.

math.DS↗

Modelling opinion dynamics under the impact of influencer and media strategies

Digital communication has made the public discourse considerably more complex, and new actors and strategies have emerged as a result of this seismic shift. Aside from the often-studied interactions among individuals during opinion formation, which have been facilitated on a large scale by social media platforms, the changing role of traditional media and the emerging role of "influencers" are not well understood, and the implications of their engagement strategies arising from the incentive structure of the attention economy even less so. Here we propose a novel opinion dynamics model that accounts for these different roles, namely that media and influencers change their own positions on slower time scales than individuals, while influencers dynamically gain and lose followers. Numerical simulations show the importance of their relative influence in creating qualitatively different opinion formation dynamics: with influencers, fragmented but short-lived clusters emerge, which are then counteracted by more stable media positions. Mean-field approximations by partial differential equations reproduce this dynamic. Based on the mean-field model, we study how strategies of influencers to gain more followers can influence the overall opinion distribution. We show that moving towards extreme positions can be a beneficial strategy for influencers to gain followers. Finally, we demonstrate that optimal control strategies allow other influencers or media to counteract such attempts and prevent further fragmentation of the opinion landscape. Our modelling framework contributes to better understanding the different roles and strategies in the increasingly complex information ecosystem and their impact on public opinion formation.

physics.soc-ph↗

Kernel Autocovariance Operators of Stationary Processes: Estimation and Convergence

We consider autocovariance operators of a stationary stochastic process on a Polish space that is embedded into a reproducing kernel Hilbert space. We investigate how empirical estimates of these operators converge along realizations of the process under various conditions. In particular, we examine ergodic and strongly mixing processes and obtain several asymptotic results as well as finite sample error bounds. We provide applications of our theory in terms of consistency results for kernel PCA with dependent data and the conditional mean embedding of transition probabilities. Finally, we use our approach to examine the nonparametric estimation of Markov transition operators and highlight how our theory can give a consistency analysis for a large family of spectral analysis methods including kernel-based dynamic mode decomposition.

math.PR↗

Mathematical modeling of spatio-temporal population dynamics and application to epidemic spreading

Agent based models (ABMs) are a useful tool for modeling spatio-temporal population dynamics, where many details can be included in the model description. Their computational cost though is very high and for stochastic ABMs a lot of individual simulations are required to sample quantities of interest. Especially, large numbers of agents render the sampling infeasible. Model reduction to a metapopulation model leads to a significant gain in computational efficiency, while preserving important dynamical properties. Based on a precise mathematical description of spatio-temporal ABMs, we present two different metapopulation approaches (stochastic and piecewise deterministic) and discuss the approximation steps between the different models within this framework. Especially, we show how the stochastic metapopulation model results from a Galerkin projection of the underlying ABM onto a finite-dimensional ansatz space. Finally, we utilize our modeling framework to provide a conceptual model for the spreading of COVID-19 that can be scaled to real-world scenarios.

math.DS↗

Solving eigenvalue PDEs of metastable diffusion processes using artificial neural networks

In this paper, we consider the eigenvalue PDE problem of the infinitesimal generators of metastable diffusion processes. We propose a numerical algorithm based on training artificial neural networks for solving the leading eigenvalues and eigenfunctions of such high-dimensional eigenvalue problem. The algorithm is able to find multiple leading eigenpairs by solving a single training task. It is useful in understanding the dynamical behaviors of metastable processes on large timescales. We demonstrate the capability of our algorithm on a high-dimensional model problem, and on the simple molecular system alanine dipeptide.

math.OC↗

A probabilistic framework for particle-based reaction-diffusion dynamics using classical Fock space representations

The modeling and simulation of stochastic reaction-diffusion processes is a topic of steady interest that is approached with a wide range of methods. \rev{At the level of particle-resolved descriptions, where chemical reactions are coupled to the spatial diffusion of individual particles, there exist comprehensive numerical simulation schemes, while the corresponding mathematical formalization is relatively underdeveloped. The aim of this paper is to provide a framework to systematically formulate the probabilistic evolution equation, termed chemical diffusion master equation (CDME), that governs particle-based stochastic reaction-diffusion processes. To account for the non-conserved and unbounded particle number of this type of open systems, we employ a classical analogue of the quantum mechanical Fock space that contains the symmetrized probability densities of the many-particle configurations in space. Following field-theoretical ideas of second quantization, we introduce creation and annihilation operators that act on single-particle densities and provide natural representations of symmetrized probability densities as well as of reaction and diffusion operators. These operators allow us to consistently and systematically formulate the CDME for arbitrary reaction schemes. The resulting form of the CDME further serves as the foundation to derive more coarse-grained descriptions of reaction-diffusion dynamics. In this regard, we show that a discretization of the evolution equation by projection onto a Fock subspace generated by a finite set of single-particle densities leads to a generalized form of the well-known reaction-diffusion master equation, which supports non-local reactions between grid cells and which converges properly in the continuum limit.

cond-mat.stat-mech↗

Data-driven modelling of nonlinear dynamics by barycentric coordinates and memory

We present a numerical method to model dynamical systems from data. We use the recently introduced method Scalable Probabilistic Approximation (SPA) to project points from a Euclidean space to convex polytopes and represent these projected states of a system in new, lower-dimensional coordinates denoting their position in the polytope. We then introduce a specific nonlinear transformation to construct a model of the dynamics in the polytope and to transform back into the original state space. To overcome the potential loss of information from the projection to a lower-dimensional polytope, we use memory in the sense of the delay-embedding theorem of Takens. By construction, our method produces stable models. We illustrate the capacity of the method to reproduce even chaotic dynamics and attractors with multiple connected components on various examples.

math.DS↗

A route to the hydrodynamic limit of a reaction-diffusion master equation using gradient structures

The reaction-diffusion master equation (RDME) is a lattice-based stochastic model for spatially resolved cellular processes. It is often interpreted as an approximation to spatially continuous reaction-diffusion models, which, in the limit of an infinitely large population, may be described by means of reaction-diffusion partial differential equations (RDPDEs). Analyzing and understanding the relation between different mathematical models for reaction-diffusion dynamics is a research topic of steady interest. In this work, we explore a route to the hydrodynamic limit of the RDME which uses gradient structures. Specifically, we elaborate on a method introduced in [J. Maas, A. Mielke: Modeling of chemical reactions systems with detailed balance using gradient structures. J. Stat. Phys. (181), 2257-2303 (2020)] in the context of well-mixed reaction networks by showing that, once it is complemented with an appropriate limit procedure, it can be applied to spatially extended systems with diffusion. Under the assumption of detailed balance, we write down a gradient structure for the RDME and use the method to produce a gradient structure for its hydrodynamic limit, namely, for the corresponding RDPDE.

cond-mat.stat-mech↗

Multiscale molecular kinetics by coupling Markov state models and reaction-diffusion dynamics

A novel approach to simulate simple protein-ligand systems at large time- and length-scales is to couple Markov state models (MSMs) of molecular kinetics with particle-based reaction-diffusion (RD) simulations, MSM/RD. Currently, MSM/RD lacks a mathematical framework to derive coupling schemes; is limited to isotropic ligands in a single conformational state, and is lacking a multi-particle extensions. In this work, we address these needs by developing a general MSM/RD framework by coarse-graining molecular dynamics into hybrid switching diffusion processes. Given enough data to parametrize the model, it is capable of modeling protein-protein interactions over large time- and length-scales, and it can be extended to handle multiple molecules. We derive the MSM/RD framework, and we implement and verify it for two protein-protein benchmark systems and one multiparticle implementation to model the formation of pentameric ring molecules. To enable reproducibility, we have published our code in the MSM/RD software package.

physics.chem-ph↗

Stochastic pH oscillations in a model of the urea-urease reaction confined to lipid vesicles

The urea-urease clock reaction is a pH switch from acid to basic that can turn into a pH oscillator if it occurs inside a suitable open reactor. We study the confinement of the reaction to lipid vesicles, which permit the exchange with an external reservoir by differential transport, enabling the recovery of the pH level and yielding a constant supply of urea molecules.For microscopically small vesicles, the discreteness of the number of molecules requires a stochastic treatment of the reaction dynamics. Our analysis shows that intrinsic noise induces a significant statistical variation of the oscillation period, which increases as the vesicles become smaller. The mean period, however, is found to be remarkably robust for vesicle sizes down to approximately 200 nm. The observed oscillations are explained as a canard-like limit cycle that differs from the wide class of conventional feedback oscillators.

physics.chem-ph↗

Optimal Reaction Coordinates: Variational Characterization and Sparse Computation

Reaction Coordinates (RCs) are indicators of hidden, low-dimensional mechanisms that govern the long-term behavior of high-dimensional stochastic processes. We present a novel and general variational characterization of optimal RCs and provide conditions for their existence. Optimal RCs are minimizers of a certain loss function and reduced models based on them guarantee very good approximation of the long-term dynamics of the original high-dimensional process. We show that, for slow-fast systems, metastable systems, and other systems with known good RCs, the novel theory reproduces previous insight. Remarkably, the numerical effort required to evaluate the loss function scales only with the complexity of the underlying, low-dimensional mechanism, and not with that of the full system. The theory provided lays the foundation for an efficient and data-sparse computation of RCs via modern machine learning techniques.

math.DS↗

Data-driven model reduction of agent-based systems using the Koopman generator

The dynamical behavior of social systems can be described by agent-based models. Although single agents follow easily explainable rules, complex time-evolving patterns emerge due to their interaction. The simulation and analysis of such agent-based models, however, is often prohibitively time-consuming if the number of agents is large. In this paper, we show how Koopman operator theory can be used to derive reduced models of agent-based systems using only simulation data. Our goal is to learn coarse-grained models and to represent the reduced dynamics by ordinary or stochastic differential equations. The new variables are, for instance, aggregated state variables of the agent-based model, modeling the collective behavior of larger groups or the entire population. Using benchmark problems with known coarse-grained models, we demonstrate that the obtained reduced systems are in good agreement with the analytical results, provided that the numbers of agents is sufficiently large.

math.DS↗

CINDy: Conditional gradient-based Identification of Non-linear Dynamics -- Noise-robust recovery

Governing equations are essential to the study of nonlinear dynamics, often enabling the prediction of previously unseen behaviors as well as the inclusion into control strategies. The discovery of governing equations from data thus has the potential to transform data-rich fields where well-established dynamical models remain unknown. This work contributes to the recent trend in data-driven sparse identification of nonlinear dynamics of finding the best sparse fit to observational data in a large library of potential nonlinear models. We propose an efficient first-order Conditional Gradient algorithm for solving the underlying optimization problem. In comparison to the most prominent alternative algorithms, the new algorithm shows significantly improved performance on several essential issues like sparsity-induction, structure-preservation, noise robustness, and sample efficiency. We demonstrate these advantages on several dynamics from the field of synchronization, particle dynamics, and enzyme chemistry.

math.DS↗

Feature space approximation for kernel-based supervised learning

We propose a method for the approximation of high- or even infinite-dimensional feature vectors, which play an important role in supervised learning. The goal is to reduce the size of the training data, resulting in lower storage consumption and computational complexity. Furthermore, the method can be regarded as a regularization technique, which improves the generalizability of learned target functions. We demonstrate significant improvements in comparison to the computation of data-driven predictions involving the full training data set. The method is applied to classification and regression problems from different application areas such as image recognition, system identification, and oceanographic time series analysis.

stat.ML↗

Statistical Analysis of Tipping Pathways in Agent-Based Models

Agent-based models are a natural choice for modeling complex social systems. In such models simple stochastic interaction rules for a large population of individuals can lead to emergent dynamics on the macroscopic scale, for instance a sudden shift of majority opinion or behavior. Here, we are concerned with studying noise-induced tipping between relevant subsets of the agent state space representing characteristic configurations. Due to the large number of interacting individuals, agent-based models are high-dimensional, though usually a lower-dimensional structure of the emerging collective behaviour exists. We therefore apply Diffusion Maps, a non-linear dimension reduction technique, to reveal the intrinsic low-dimensional structure. We characterize the tipping behaviour by means of Transition Path Theory, which helps gaining a statistical understanding of the tipping paths such as their distribution, flux and rate. By systematically studying two agent-based models that exhibit a multitude of tipping pathways and cascading effects, we illustrate the practicability of our approach.

physics.soc-ph↗