@misc{FischerSchuetteDeuflhardetal.2001, author = {Fischer, Alexander and Sch{\"u}tte, Christof and Deuflhard, Peter and Cordes, Frank}, title = {Hierarchical Uncoupling-Coupling of Metastable Conformations}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6296}, number = {01-03}, year = {2001}, abstract = {Uncoupling-coupling Monte Carlo (UCMC) combines uncoupling techniques for finite Markov chains with Markov chain Monte Carlo methodology. UCMC aims at avoiding the typical metastable or trapping behavior of Monte Carlo techniques. From the viewpoint of Monte Carlo, a slowly converging long-time Markov chain is replaced by a limited number of rapidly mixing short-time ones. Therefore, the state space of the chain has to be hierarchically decomposed into its metastable conformations. This is done by means of combining the technique of conformation analysis as recently introduced by the authors, and appropriate annealing strategies. We present a detailed examination of the uncoupling-coupling procedure which uncovers its theoretical background, and illustrates the hierarchical algorithmic approach. Furthermore, application of the UCMC algorithm to the \$n\$-pentane molecule allows us to discuss the effect of its crucial steps in a typical molecular scenario.}, language = {en} } @article{WulkowKoltaiSunkaraetal.2021, author = {Wulkow, Niklas and Koltai, P{\´e}ter and Sunkara, Vikram and Sch{\"u}tte, Christof}, title = {Data-driven modelling of nonlinear dynamics by barycentric coordinates and memory}, journal = {J. Stat. Phys.}, arxiv = {http://arxiv.org/abs/2112.06742}, year = {2021}, abstract = {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.}, language = {en} } @misc{ErnstSchuetteSigristetal.2021, author = {Ernst, Ariane and Sch{\"u}tte, Christof and Sigrist, Stephan and Winkelmann, Stefanie}, title = {Variance of filtered signals: Characterization for linear reaction networks and application to neurotransmission dynamics}, issn = {1438-0064}, doi = {10.1016/j.mbs.2021.108760}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-82674}, year = {2021}, abstract = {Neurotransmission at chemical synapses relies on the calcium-induced fusion of synaptic vesicles with the presynaptic membrane. The distance to the calcium channels determines the release probability and thereby the postsynaptic signal. Suitable models of the process need to capture both the mean and the variance observed in electrophysiological measurements of the postsynaptic current. In this work, we propose a method to directly compute the exact first- and second-order moments for signals generated by a linear reaction network under convolution with an impulse response function, rendering computationally expensive numerical simulations of the underlying stochastic counting process obsolete. We show that the autocorrelation of the process is central for the calculation of the filtered signal's second-order moments, and derive a system of PDEs for the cross-correlation functions (including the autocorrelations) of linear reaction networks with time-dependent rates. Finally, we employ our method to efficiently compare different spatial coarse graining approaches for a specific model of synaptic vesicle fusion. Beyond the application to neurotransmission processes, the developed theory can be applied to any linear reaction system that produces a filtered stochastic signal.}, language = {en} } @article{ErnstSchuetteSigristetal.2022, author = {Ernst, Ariane and Sch{\"u}tte, Christof and Sigrist, Stephan and Winkelmann, Stefanie}, title = {Variance of filtered signals: Characterization for linear reaction networks and application to neurotransmission dynamics}, volume = {343}, journal = {Mathematical Biosciences}, doi = {10.1016/j.mbs.2021.108760}, year = {2022}, abstract = {Neurotransmission at chemical synapses relies on the calcium-induced fusion of synaptic vesicles with the presynaptic membrane. The distance to the calcium channels determines the release probability and thereby the postsynaptic signal. Suitable models of the process need to capture both the mean and the variance observed in electrophysiological measurements of the postsynaptic current. In this work, we propose a method to directly compute the exact first- and second-order moments for signals generated by a linear reaction network under convolution with an impulse response function, rendering computationally expensive numerical simulations of the underlying stochastic counting process obsolete. We show that the autocorrelation of the process is central for the calculation of the filtered signal's second-order moments, and derive a system of PDEs for the cross-correlation functions (including the autocorrelations) of linear reaction networks with time-dependent rates. Finally, we employ our method to efficiently compare different spatial coarse graining approaches for a specific model of synaptic vesicle fusion. Beyond the application to neurotransmission processes, the developed theory can be applied to any linear reaction system that produces a filtered stochastic signal.}, language = {en} } @article{ThiesSunkaraRayetal.2023, author = {Thies, Arne and Sunkara, Vikram and Ray, Sourav and Wulkow, Hanna and Celik, M. {\"O}zg{\"u}r and Yerg{\"o}z, Fatih and Sch{\"u}tte, Christof and Stein, Christoph and Weber, Marcus and Winkelmann, Stefanie}, title = {Modelling altered signalling of G-protein coupled receptors in inflamed environment to advance drug design}, volume = {13}, journal = {Scientific Reports}, number = {607}, doi = {10.1038/s41598-023-27699-w}, year = {2023}, abstract = {We previously reported the successful design, synthesis and testing of the prototype opioid painkiller NFEPP that does not elicit adverse side effects. The design process of NFEPP was based on mathematical modelling of extracellular interactions between G-protein coupled receptors (GPCRs) and ligands, recognizing that GPCRs function differently under pathological versus healthy conditions. We now present an additional and novel stochastic model of GPCR function that includes intracellular dissociation of G-protein subunits and modulation of plasma membrane calcium channels and their dependence on parameters of inflamed and healthy tissue (pH, radicals). The model is validated against in vitro experimental data for the ligands NFEPP and fentanyl at different pH values and radical concentrations. We observe markedly reduced binding affinity and calcium channel inhibition for NFEPP at normal pH compared to lower pH, in contrast to the effect of fentanyl. For increasing radical concentrations, we find enhanced constitutive G-protein activation but reduced ligand binding affinity. Assessing the different effects, the results suggest that, compared to radicals, low pH is a more important determinant of overall GPCR function in an inflamed environment. Future drug design efforts should take this into account.}, language = {en} } @misc{RayThiesSunkaraetal.2021, author = {Ray, Sourav and Thies, Arne and Sunkara, Vikram and Wulkow, Hanna and Celik, {\"O}zg{\"u}r and Yerg{\"o}z, Fatih and Sch{\"u}tte, Christof and Stein, Christoph and Weber, Marcus and Winkelmann, Stefanie}, title = {Modelling altered signalling of G-protein coupled receptors in inflamed environment to advance drug design}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-82797}, year = {2021}, abstract = {Initiated by mathematical modelling of extracellular interactions between G-protein coupled receptors (GPCRs) and ligands in normal versus diseased (inflamed) environments, we previously reported the successful design, synthesis and testing of the prototype opioid painkiller NFEPP that does not elicit adverse side effects. Uniquely, this design recognised that GPCRs function differently under pathological versus healthy conditions. We now present a novel stochastic model of GPCR function that includes intracellular dissociation of G-protein subunits and modulation of plasma membrane calcium channels associated with parameters of inflamed tissue (pH, radicals). By means of molecular dynamics simulations, we also assessed qualitative changes of the reaction rates due to additional disulfide bridges inside the GPCR binding pocket and used these rates for stochastic simulations of the corresponding reaction jump process. The modelling results were validated with in vitro experiments measuring calcium currents and G-protein activation. We found markedly reduced G-protein dissociation and calcium channel inhibition induced by NFEPP at normal pH, and enhanced constitutive G-protein activation but lower probability of ligand binding with increasing radical concentrations. These results suggest that, compared to radicals, low pH is a more important determinant of overall GPCR function in an inflamed environment. Future drug design efforts should take this into account.}, language = {en} } @article{MontefuscoSchuetteWinkelmann2023, author = {Montefusco, Alberto and Sch{\"u}tte, Christof and Winkelmann, Stefanie}, title = {A route to the hydrodynamic limit of a reaction-diffusion master equation using gradient structures}, volume = {83}, journal = {SIAM Journal on Applied Mathematics}, number = {2}, arxiv = {http://arxiv.org/abs/2201.02613}, doi = {10.1137/22M1488831}, pages = {837 -- 861}, year = {2023}, abstract = {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. 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 and A. Mielke, J. Stat. Phys., 181 (2020), pp. 2257-2303] 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 in order to produce a gradient structure for its hydrodynamic limit, namely, for the corresponding RDPDE.}, language = {en} } @article{PeppertvonKleistSchuetteetal.2022, author = {Peppert, Felix and von Kleist, Max and Sch{\"u}tte, Christof and Sunkara, Vikram}, title = {On the Sufficient Condition for Solving the Gap-Filling Problem Using Deep Convolutional Neural Networks}, volume = {33}, journal = {IEEE Transactions on Neural Networks and Learning Systems}, number = {11}, doi = {10.1109/TNNLS.2021.3072746}, pages = {6194 -- 6205}, year = {2022}, abstract = {Deep convolutional neural networks (DCNNs) are routinely used for image segmentation of biomedical data sets to obtain quantitative measurements of cellular structures like tissues. These cellular structures often contain gaps in their boundaries, leading to poor segmentation performance when using DCNNs like the U-Net. The gaps can usually be corrected by post-hoc computer vision (CV) steps, which are specific to the data set and require a disproportionate amount of work. As DCNNs are Universal Function Approximators, it is conceivable that the corrections should be obsolete by selecting the appropriate architecture for the DCNN. In this article, we present a novel theoretical framework for the gap-filling problem in DCNNs that allows the selection of architecture to circumvent the CV steps. Combining information-theoretic measures of the data set with a fundamental property of DCNNs, the size of their receptive field, allows us to formulate statements about the solvability of the gap-filling problem independent of the specifics of model training. In particular, we obtain mathematical proof showing that the maximum proficiency of filling a gap by a DCNN is achieved if its receptive field is larger than the gap length. We then demonstrate the consequence of this result using numerical experiments on a synthetic and real data set and compare the gap-filling ability of the ubiquitous U-Net architecture with variable depths. Our code is available at https://github.com/ai-biology/dcnn-gap-filling.}, language = {en} } @article{BittracherMollenhauerKoltaietal.2023, author = {Bittracher, Andreas and Mollenhauer, Mattes and Koltai, P{\´e}ter and Sch{\"u}tte, Christof}, title = {Optimal Reaction Coordinates: Variational Characterization and Sparse Computation}, volume = {21}, journal = {Multiscale Modelling \& Simulation}, number = {2}, arxiv = {http://arxiv.org/abs/2107.10158}, doi = {10.1137/21M1448367}, pages = {449 -- 488}, year = {2023}, abstract = {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 a good approximation of the statistical long-term properties 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, for reversible systems, the numerical effort required to evaluate the loss function scales only with the variability 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.}, language = {en} } @article{MollenhauerKlusSchuetteetal.2022, author = {Mollenhauer, Mattes and Klus, Stefan and Sch{\"u}tte, Christof and Koltai, P{\´e}ter}, title = {Kernel Autocovariance Operators of Stationary Processes: Estimation and Convergence}, volume = {23}, journal = {Journal of Machine Learning Research}, number = {327}, arxiv = {http://arxiv.org/abs/2004.00891}, pages = {1 -- 34}, year = {2022}, abstract = {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.}, language = {en} } @misc{HelfmannDjurdjevacConradLorenzSpreenetal.2023, author = {Helfmann, Luzie and Djurdjevac Conrad, Natasa and Lorenz-Spreen, Philipp and Sch{\"u}tte, Christof}, title = {Supplementary code for the paper Modelling opinion dynamics under the impact of influencer and media strategies}, doi = {10.12752/9267}, year = {2023}, abstract = {This repository contains the Julia code accompanying the paper "Modelling opinion dynamics under the impact of influencer and media strategies", Scientific Reports, Vol.13, p. 19375, 2023.}, language = {en} } @misc{Secker2023, author = {Secker, Christopher}, title = {Novel multi-objective affinity approach allows to identify pH-specific μ-opioid receptor agonists (Dataset)}, doi = {10.12752/9622}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-96220}, year = {2023}, abstract = {Virtual Screening Dataset for the paper "Novel multi-objective affinity approach allows to identify pH-specific μ-opioid receptor agonists" by Secker et al. (https://doi.org/10.1186/s13321-023-00746-4)}, language = {en} } @article{WehlitzSadeghiMontefuscoetal.2025, author = {Wehlitz, Nathalie and Sadeghi, Mohsen and Montefusco, Alberto and Sch{\"u}tte, Christof and Pavliotis, Grigorios A. and Winkelmann, Stefanie}, title = {Approximating particle-based clustering dynamics by stochastic PDEs}, volume = {24}, journal = {SIAM Journal on Applied Dynamical Systems}, number = {2}, arxiv = {http://arxiv.org/abs/2407.18952}, doi = {10.1137/24M1676661}, pages = {1231 -- 1250}, year = {2025}, abstract = {This work proposes stochastic partial differential equations (SPDEs) as a practical tool to replicate clustering effects of more detailed particle-based dynamics. Inspired by membrane mediated receptor dynamics on cell surfaces, we formulate a stochastic particle-based model for diffusion and pairwise interaction of particles, leading to intriguing clustering phenomena. Employing numerical simulation and cluster detection methods, we explore the approximation of the particle-based clustering dynamics through mean-field approaches. We find that SPDEs successfully reproduce spatiotemporal clustering dynamics, not only in the initial cluster formation period, but also on longer time scales where the successive merging of clusters cannot be tracked by deterministic mean-field models. The computational efficiency of the SPDE approach allows us to generate extensive statistical data for parameter estimation in a simpler model that uses a Markov jump process to capture the temporal evolution of the cluster number.}, language = {en} } @article{KostreDjurdjevacConradSchuetteetal.2024, author = {Kostr{\´e}, Margarita and Djurdjevac Conrad, Natasa and Sch{\"u}tte, Christof and Sunkara, Vikram}, title = {Exploration of Particle Swarm Optimisation Algorithm with Divergent Parameters}, journal = {Natural Computing}, year = {2024}, language = {en} } @article{RegenyiMashreghiSchuetteetal.2024, author = {Reg{\´e}nyi, Enikő and Mashreghi, Mir-Farzin and Sch{\"u}tte, Christof and Sunkara, Vikram}, title = {Exploring transcription modalities from bimodal, single-cell RNA sequencing data}, volume = {6}, journal = {NAR Genomics and Bioinformatics}, number = {4}, publisher = {Oxford University Press (OUP)}, issn = {2631-9268}, doi = {10.1093/nargab/lqae179}, year = {2024}, abstract = {Abstract There is a growing interest in generating bimodal, single-cell RNA sequencing (RNA-seq) data for studying biological pathways. These data are predominantly utilized in understanding phenotypic trajectories using RNA velocities; however, the shape information encoded in the two-dimensional resolution of such data is not yet exploited. In this paper, we present an elliptical parametrization of two-dimensional RNA-seq data, from which we derived statistics that reveal four different modalities. These modalities can be interpreted as manifestations of the changes in the rates of splicing, transcription or degradation. We performed our analysis on a cell cycle and a colorectal cancer dataset. In both datasets, we found genes that are not picked up by differential gene expression analysis (DGEA), and are consequently unnoticed, yet visibly delineate phenotypes. This indicates that, in addition to DGEA, searching for genes that exhibit the discovered modalities could aid recovering genes that set phenotypes apart. For communities studying biomarkers and cellular phenotyping, the modalities present in bimodal RNA-seq data broaden the search space of genes, and furthermore, allow for incorporating cellular RNA processing into regulatory analyses.}, language = {en} } @inproceedings{RiberaBorrellRichterSchuette2025, author = {Ribera Borrell, Enric and Richter, Lorenz and Sch{\"u}tte, Christof}, title = {Reinforcement Learning with Random Time Horizons}, volume = {267}, booktitle = {Proceedings of the 42nd International Conference on Machine Learning}, arxiv = {http://arxiv.org/abs/2506.00962}, pages = {5101 -- 5123}, year = {2025}, language = {en} } @misc{RiberaBorrellQuerRichteretal.2021, author = {Ribera Borrell, Enric and Quer, Jannes and Richter, Lorenz and Sch{\"u}tte, Christof}, title = {Improving control based importance sampling strategies for metastable diffusions via adapted metadynamics}, issn = {1438-0064}, year = {2021}, abstract = {Sampling rare events in metastable dynamical systems is often a computationally expensive task and one needs to resort to enhanced sampling methods such as importance sampling. Since we can formulate the problem of finding optimal importance sampling controls as a stochastic optimization problem, this then brings additional numerical challenges and the convergence of corresponding algorithms might as well suffer from metastabilty. In this article we address this issue by combining systematic control approaches with the heuristic adaptive metadynamics method. Crucially, we approximate the importance sampling control by a neural network, which makes the algorithm in principle feasible for high dimensional applications. We can numerically demonstrate in relevant metastable problems that our algorithm is more effective than previous attempts and that only the combination of the two approaches leads to a satisfying convergence and therefore to an efficient sampling in certain metastable settings.}, language = {en} } @article{SchuetteKlusHartmann2023, author = {Sch{\"u}tte, Christof and Klus, Stefan and Hartmann, Carsten}, title = {Overcoming the Timescale Barrier in Molecular Dynamics: Transfer Operators, Variational Principles, and Machine Learning}, volume = {32}, journal = {Acta Numerica}, doi = {10.1017/S0962492923000016}, pages = {517 -- 673}, year = {2023}, abstract = {One of the main challenges in molecular dynamics is overcoming the 'timescale barrier': in many realistic molecular systems, biologically important rare transitions occur on timescales that are not accessible to direct numerical simulation, even on the largest or specifically dedicated supercomputers. This article discusses how to circumvent the timescale barrier by a collection of transfer operator-based techniques that have emerged from dynamical systems theory, numerical mathematics and machine learning over the last two decades. We will focus on how transfer operators can be used to approximate the dynamical behaviour on long timescales, review the introduction of this approach into molecular dynamics, and outline the respective theory, as well as the algorithmic development, from the early numerics-based methods, via variational reformulations, to modern data-based techniques utilizing and improving concepts from machine learning. Furthermore, its relation to rare event simulation techniques will be explained, revealing a broad equivalence of variational principles for long-time quantities in molecular dynamics. The article will mainly take a mathematical perspective and will leave the application to real-world molecular systems to the more than 1000 research articles already written on this subject.}, language = {en} } @article{MontefuscoHelfmannOkunolaetal.2024, author = {Montefusco, Alberto and Helfmann, Luzie and Okunola, Toluwani and Winkelmann, Stefanie and Sch{\"u}tte, Christof}, title = {Partial mean-field model for neurotransmission dynamics}, volume = {369}, journal = {Mathematical Biosciences}, arxiv = {http://arxiv.org/abs/2307.01737}, doi = {10.1016/j.mbs.2024.109143}, year = {2024}, abstract = {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.}, language = {en} } @article{NiemannKlusConradetal.2024, author = {Niemann, Jan-Hendrik and Klus, Stefan and Conrad, Natasa Djurdjevac and Sch{\"u}tte, Christof}, title = {Koopman-Based Surrogate Models for Multi-Objective Optimization of Agent-Based Systems}, volume = {460}, journal = {Physica D: Nonlinear Phenomena}, arxiv = {http://arxiv.org/abs/2306.17666}, doi = {https://doi.org/10.1016/j.physd.2024.134052}, pages = {134052}, year = {2024}, abstract = {Agent-based models (ABMs) provide an intuitive and powerful framework for studying social dynamics by modeling the interactions of individuals from the perspective of each individual. In addition to simulating and forecasting the dynamics of ABMs, the demand to solve optimization problems to support, for example, decision-making processes naturally arises. Most ABMs, however, are non-deterministic, high-dimensional dynamical systems, so objectives defined in terms of their behavior are computationally expensive. In particular, if the number of agents is large, evaluating the objective functions often becomes prohibitively time-consuming. We consider data-driven reduced models based on the Koopman generator to enable the efficient solution of multi-objective optimization problems involving ABMs. In a first step, we show how to obtain data-driven reduced models of non-deterministic dynamical systems (such as ABMs) that depend on potentially nonlinear control inputs. We then use them in the second step as surrogate models to solve multi-objective optimal control problems. We first illustrate our approach using the example of a voter model, where we compute optimal controls to steer the agents to a predetermined majority, and then using the example of an epidemic ABM, where we compute optimal containment strategies in a prototypical situation. We demonstrate that the surrogate models effectively approximate the Pareto-optimal points of the ABM dynamics by comparing the surrogate-based results with test points, where the objectives are evaluated using the ABM. Our results show that when objectives are defined by the dynamic behavior of ABMs, data-driven surrogate models support or even enable the solution of multi-objective optimization problems.}, language = {en} } @article{DjurdjevacConradChemnitzKostreetal.2024, author = {Djurdjevac Conrad, Natasa and Chemnitz, Robin and Kostre, Margarita and Schweigart, Fleur and Fless, Friederike and Sch{\"u}tte, Christof and Ducke, Benjamin}, title = {A Mathematical perspective on Romanisation: Modelling the Roman road activation process in ancient Tunisia}, volume = {19}, journal = {PLoS ONE}, number = {9}, doi = {10.1371/journal.pone.0309752}, year = {2024}, abstract = {Romanisation is a multi-faceted historical phenomenon with profound and lasting cultural impact on the ancient world. In the modern-day territory of Tunisia, this is particularly manifest during the first four centuries AD, under the reign of the Roman Empire. We derive a reduced, operational concept of Romanisation as a cultural diffusion process that is observable in the archaeological remains of the Roman era settlement system. We then introduce a novel mathematical model that computes spatio-temporal approximations for the Romanisation of the settlement system. The model is based on the concept of temporal road activation and makes minimal assumptions regarding input data quality. The results of our study contribute to the understanding of the time dynamics of the region's road network, under the influence of Romanisation. Our model can be applied in similar archaeological research scenarios, to generate spatio-temporal backbones for the analysis of otherwise intractably complex social processes.}, language = {en} } @inproceedings{ChaukairSchuetteSunkara2023, author = {Chaukair, Mustafa and Sch{\"u}tte, Christof and Sunkara, Vikram}, title = {On the Activation Space of ReLU Equipped Deep Neural Networks}, volume = {222}, booktitle = {Procedia Computer Science}, doi = {10.1016/j.procs.2023.08.200}, pages = {624 -- 635}, year = {2023}, abstract = {Modern Deep Neural Networks are getting wider and deeper in their architecture design. However, with an increasing number of parameters the decision mechanisms becomes more opaque. Therefore, there is a need for understanding the structures arising in the hidden layers of deep neural networks. In this work, we present a new mathematical framework for describing the canonical polyhedral decomposition in the input space, and in addition, we introduce the notions of collapsing- and preserving patches, pertinent to understanding the forward map and the activation space they induce. The activation space can be seen as the output of a layer and, in the particular case of ReLU activations, we prove that this output has the structure of a polyhedral complex.}, language = {en} } @article{PlockHammerschmidtBurgeretal.2023, author = {Plock, Matthias and Hammerschmidt, Martin and Burger, Sven and Schneider, Philipp-Immanuel and Sch{\"u}tte, Christof}, title = {Impact Study of Numerical Discretization Accuracy on Parameter Reconstructions and Model Parameter Distributions}, volume = {60}, journal = {Metrologia}, arxiv = {http://arxiv.org/abs/2305.02663}, doi = {10.1088/1681-7575/ace4cd}, pages = {054001}, year = {2023}, abstract = {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.}, language = {en} } @article{CoomberChewleSeckeretal.2025, author = {Coomber, Celvic and Chewle, Surahit and Secker, Christopher and Fackeldey, Konstantin and Weber, Marcus and Winkelmann, Stefanie and Sch{\"u}tte, Christof and Sunkara, Vikram}, title = {Investigating Endogenous Opioids Unravels the Mechanisms Behind Opioid-Induced Constipation, a Mathematical Modeling Approach}, volume = {26}, journal = {International Journal of Molecular Sciences}, number = {13}, doi = {10.3390/ijms26136207}, year = {2025}, abstract = {Endogenous opioids, such as Endomorphin-2, are not typically associated with severe constipation, unlike pharmaceutical opioids, which induce opioid-induced constipation (OIC) by activating μ-opioid receptors in the gastrointestinal tract. In this study, we present a mathematical model, which integrates the serotonergic and opioid pathways, simulating the interaction between serotonin and opioid signaling within the enteric nervous system (ENS). The model explores the mechanisms underlying OIC, with a focus on the change in adenylyl cyclase (AC) activity, cAMP accumulation, and the distinct functionalities of Endomorphin-2 compared to commonly used pharmaceutical opioids. We study the effects of Morphine, Fentanyl, and Methadone and contrast them with Endomorphin-2. Our findings reveal that opioids do not perturb the signaling of serotonin, but only the activity of AC, suggesting that serotonin levels have no influence on improving opioid-induced constipation. Furthermore, this study reveals that the primary difference between endogenous and pharmaceutical opioids is their degradation rates. This finding shows that modulating opioid degradation rates significantly improves cAMP recovery. In conclusion, our insights steer towards exploring opioid degrading enzymes, localized to the gut, as a strategy for mitigating OIC.}, language = {en} } @article{WinkelmannZonkerSchuetteetal.2021, author = {Winkelmann, Stefanie and Zonker, Johannes and Sch{\"u}tte, Christof and Djurdjevac Conrad, Natasa}, title = {Mathematical modeling of spatio-temporal population dynamics and application to epidemic spreading}, volume = {336}, journal = {Mathematical Biosciences}, publisher = {Elsevier}, arxiv = {http://arxiv.org/abs/2205.05000}, doi = {10.1016/j.mbs.2021.108619}, year = {2021}, abstract = {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.}, language = {en} } @article{RaharinirinaPeppertvonKleistetal.2021, author = {Raharinirina, Alexia N. and Peppert, Felix and von Kleist, Max and Sch{\"u}tte, Christof and Sunkara, Vikram}, title = {Inferring gene regulatory networks from single-cell RNA-seq temporal snapshot data requires higher-order moments}, volume = {2}, journal = {Patterns}, number = {9}, doi = {10.1016/j.patter.2021.100332}, year = {2021}, abstract = {Single-cell RNA sequencing (scRNA-seq) has become ubiquitous in biology. Recently, there has been a push for using scRNA-seq snapshot data to infer the underlying gene regulatory networks (GRNs) steering cellular function. To date, this aspiration remains unrealized due to technical and computational challenges. In this work we focus on the latter, which is under-represented in the literature. We took a systemic approach by subdividing the GRN inference into three fundamental components: data pre-processing, feature extraction, and inference. We observed that the regulatory signature is captured in the statistical moments of scRNA-seq data and requires computationally intensive minimization solvers to extract it. Furthermore, current data pre-processing might not conserve these statistical moments. Although our moment-based approach is a didactic tool for understanding the different compartments of GRN inference, this line of thinking—finding computationally feasible multi-dimensional statistics of data—is imperative for designing GRN inference methods.}, language = {en} } @misc{NiemannSchuetteKlus2021, author = {Niemann, Jan-Hendrik and Sch{\"u}tte, Christof and Klus, Stefan}, title = {Simulation data: Data-driven model reduction of agent-based systems using the Koopman generator}, volume = {16}, journal = {PLOS ONE}, number = {5}, doi = {http://doi.org/10.5281/zenodo.4522119}, year = {2021}, language = {en} } @article{delRazoFroembergStraubeetal.2022, author = {del Razo, Mauricio and Fr{\"o}mberg, Daniela and Straube, Arthur and Sch{\"u}tte, Christof and H{\"o}fling, Felix and Winkelmann, Stefanie}, title = {A probabilistic framework for particle-based reaction-diffusion dynamics using classical Fock space representations}, volume = {112}, journal = {Letters in Mathematical Physics}, number = {49}, arxiv = {http://arxiv.org/abs/arXiv:2109.13616}, doi = {10.1007/s11005-022-01539-w}, year = {2022}, language = {en} } @article{StraubeWinkelmannSchuetteetal.2021, author = {Straube, Arthur and Winkelmann, Stefanie and Sch{\"u}tte, Christof and H{\"o}fling, Felix}, title = {Stochastic pH oscillations in a model of the urea-urease reaction confined to lipid vesicles}, volume = {12}, journal = {J. Phys. Chem. Lett.}, doi = {10.1021/acs.jpclett.1c03016}, pages = {9888 -- 9893}, year = {2021}, abstract = {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 numerically 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, but the periodicity of the rhythm is gradually destroyed for smaller vesicles. The observed oscillations are explained as a canard-like limit cycle that differs from the wide class of conventional feedback oscillators.}, language = {en} } @article{RiberaBorrellQuerRichteretal.2023, author = {Ribera Borrell, Enric and Quer, Jannes and Richter, Lorenz and Sch{\"u}tte, Christof}, title = {Improving control based importance sampling strategies for metastable diffusions via adapted metadynamics}, volume = {89}, journal = {SIAM Journal on Scientific Computing (SISC)}, number = {1}, doi = {10.1137/22M1503464}, year = {2023}, abstract = {Sampling rare events in metastable dynamical systems is often a computationally expensive task and one needs to resort to enhanced sampling methods such as importance sampling. Since we can formulate the problem of finding optimal importance sampling controls as a stochastic optimization problem, this then brings additional numerical challenges and the convergence of corresponding algorithms might as well suffer from metastabilty. In this article we address this issue by combining systematic control approaches with the heuristic adaptive metadynamics method. Crucially, we approximate the importance sampling control by a neural network, which makes the algorithm in principle feasible for high dimensional applications. We can numerically demonstrate in relevant metastable problems that our algorithm is more effective than previous attempts and that only the combination of the two approaches leads to a satisfying convergence and therefore to an efficient sampling in certain metastable settings.}, language = {en} } @article{HelfmannConradLorenzSpreenetal.2023, author = {Helfmann, Luzie and Conrad, Natasa Djurdjevac and Lorenz-Spreen, Philipp and Sch{\"u}tte, Christof}, title = {Modelling opinion dynamics under the impact of influencer and media strategies}, volume = {13}, journal = {Scientific Reports}, arxiv = {http://arxiv.org/abs/2301.13661}, doi = {10.1038/s41598-023-46187-9}, pages = {19375}, year = {2023}, abstract = {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.}, language = {en} } @article{ErnstUngerSchuetteetal.2023, author = {Ernst, Ariane and Unger, Nathalie and Sch{\"u}tte, Christof and Walter, Alexander and Winkelmann, Stefanie}, title = {Rate-limiting recovery processes in neurotransmission under sustained stimulation}, volume = {362}, journal = {Mathematical Biosciences}, arxiv = {http://arxiv.org/abs/2302.01635}, doi = {10.1016/j.mbs.2023.109023}, year = {2023}, abstract = {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 neurotrans-mission 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 dynamics 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 an asymptotic periodicity of the ODE-solution.}, language = {de} } @article{SeckerFackeldeyWeberetal.2023, author = {Secker, Christopher and Fackeldey, Konstantin and Weber, Marcus and Ray, Sourav and Gorgulla, Christoph and Sch{\"u}tte, Christof}, title = {Novel multi-objective affinity approach allows to identify pH-specific μ-opioid receptor agonists}, volume = {15}, journal = {Journal of Cheminformatics}, doi = {10.1186/s13321-023-00746-4}, year = {2023}, abstract = {Opioids are essential pharmaceuticals due to their analgesic properties, however, lethal side effects, addiction, and opioid tolerance are extremely challenging. The development of novel molecules targeting the μ-opioid receptor (MOR) in inflamed, but not in healthy tissue, could significantly reduce these unwanted effects. Finding such novel molecules can be achieved by maximizing the binding affinity to the MOR at acidic pH while minimizing it at neutral pH, thus combining two conflicting objectives. Here, this multi-objective optimal affinity approach is presented, together with a virtual drug discovery pipeline for its practical implementation. When applied to finding pH-specific drug candidates, it combines protonation state-dependent structure and ligand preparation with high-throughput virtual screening. We employ this pipeline to characterize a set of MOR agonists identifying a morphine-like opioid derivative with higher predicted binding affinities to the MOR at low pH compared to neutral pH. Our results also confirm existing experimental evidence that NFEPP, a previously described fentanyl derivative with reduced side effects, and recently reported β-fluorofentanyls and -morphines show an increased specificity for the MOR at acidic pH when compared to fentanyl and morphine. We further applied our approach to screen a >50K ligand library identifying novel molecules with pH-specific predicted binding affinities to the MOR. The presented differential docking pipeline can be applied to perform multi-objective affinity optimization to identify safer and more specific drug candidates at large scale.}, language = {en} } @article{CardereraPokuttaSchuetteetal.2021, author = {Carderera, Alejandro and Pokutta, Sebastian and Sch{\"u}tte, Christof and Weiser, Martin}, title = {An efficient first-order conditional gradient algorithm in data-driven sparse identification of nonlinear dynamics to solve sparse recovery problems under noise}, journal = {Journal of Computational and Applied Mathematics}, arxiv = {http://arxiv.org/abs/2101.02630}, year = {2021}, abstract = {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.}, language = {en} } @article{WulkowTelgmannHungenbergetal.2021, author = {Wulkow, Niklas and Telgmann, Regina and Hungenberg, Klaus-Dieter and Sch{\"u}tte, Christof and Wulkow, Michael}, title = {Deterministic and Stochastic Parameter Estimation for Polymer Reaction Kinetics I: Theory and Simple Examples}, volume = {30}, journal = {Macromolecular Theory and Simulations}, doi = {10.1002/mats.202100017}, year = {2021}, abstract = {Two different approaches to parameter estimation (PE) in the context of polymerization are introduced, refined, combined, and applied. The first is classical PE where one is interested in finding parameters which minimize the distance between the output of a chemical model and experimental data. The second is Bayesian PE allowing for quantifying parameter uncertainty caused by experimental measurement error and model imperfection. Based on detailed descriptions of motivation, theoretical background, and methodological aspects for both approaches, their relation are outlined. The main aim of this article is to show how the two approaches complement each other and can be used together to generate strong information gain regarding the model and its parameters. Both approaches and their interplay in application to polymerization reaction systems are illustrated. This is the first part in a two-article series on parameter estimation for polymer reaction kinetics with a focus on theory and methodology while in the second part a more complex example will be considered.}, language = {en} } @article{delRazoDibakSchuetteetal.2021, author = {del Razo, Mauricio J. and Dibak, Manuel and Sch{\"u}tte, Christof and No{\´e}, Frank}, title = {Multiscale molecular kinetics by coupling Markov state models and reaction-diffusion dynamics}, volume = {155}, journal = {The Journal of Chemical Physics}, number = {12}, doi = {10.1063/5.0060314}, year = {2021}, language = {en} } @article{GelssKlusSchusteretal.2021, author = {Gelss, Patrick and Klus, Stefan and Schuster, Ingmar and Sch{\"u}tte, Christof}, title = {Feature space approximation for kernel-based supervised learning}, volume = {221}, journal = {Knowledge-Based Sytems}, publisher = {Elsevier}, doi = {https://doi.org/10.1016/j.knosys.2021.106935}, year = {2021}, language = {en} } @article{BittracherMoschnerKokschetal.2021, author = {Bittracher, Andreas and Moschner, Johann and Koksch, Beate and Netz, Roland and Sch{\"u}tte, Christof}, title = {Exploring the locking stage of NFGAILS amyloid fibrillation via transition manifold analysis}, volume = {94}, journal = {The European Physical Journal B}, doi = {10.1140/epjb/s10051-021-00200-0}, year = {2021}, language = {en} } @article{HelfmannHeitzigKoltaietal.2021, author = {Helfmann, Luzie and Heitzig, Jobst and Koltai, P{\´e}ter and Kurths, J{\"u}rgen and Sch{\"u}tte, Christof}, title = {Statistical analysis of tipping pathways in agent-based models}, volume = {230}, journal = {Eur. Phys. J. Spec. Top.}, arxiv = {http://arxiv.org/abs/2103.02883}, doi = {10.1140/epjs/s11734-021-00191-0}, pages = {3249 -- 3271}, year = {2021}, abstract = {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 on the microscopic scale can lead to emergent dynamics on the macroscopic scale, for instance a sudden shift of majority opinion or behavior. Here we are introducing a methodology for studying noise-induced tipping between relevant subsets of the agent state space representing characteristic configurations. Due to a 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.}, language = {en} } @article{SikorskiWeberSchuette2021, author = {Sikorski, Alexander and Weber, Marcus and Sch{\"u}tte, Christof}, title = {The Augmented Jump Chain}, volume = {4}, journal = {Advanced Theory and Simulations}, number = {4}, publisher = {Wiley-VCH}, arxiv = {http://arxiv.org/abs/2008.04624}, doi = {10.1002/adts.202000274}, year = {2021}, abstract = {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.}, language = {en} } @misc{SchuetteKlusHartmann2022, author = {Sch{\"u}tte, Christof and Klus, Stefan and Hartmann, Carsten}, title = {Overcoming the Timescale Barrier in Molecular Dynamics: Transfer Operators, Variational Principles, and Machine Learning}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-88637}, year = {2022}, abstract = {One of the main challenges in molecular dynamics is overcoming the "timescale barrier", a phrase used to describe that in many realistic molecular systems, biologically important rare transitions occur on timescales that are not accessible to direct numerical simulation, not even on the largest or specifically dedicated supercomputers. This article discusses how to circumvent the timescale barrier by a collection of transfer operator-based techniques that have emerged from dynamical systems theory, numerical mathematics, and machine learning over the last two decades. We will focus on how transfer operators can be used to approximate the dynamical behavior on long timescales, review the introduction of this approach into molecular dynamics, and outline the respective theory as well as the algorithmic development from the early numerics-based methods, via variational reformulations, to modern data-based techniques utilizing and improving concepts from machine learning. Furthermore, its relation to rare event simulation techniques will be explained, revealing a broad equivalence of variational principles for long-time quantities in MD. The article will mainly take a mathematical perspective and will leave the application to real-world molecular systems to the more than 1000 research articles already written on this subject.}, language = {en} } @article{SchulzePeppertSchuetteetal.2025, author = {Schulze, Kenrick and Peppert, Felix and Sch{\"u}tte, Christof and Sunkara, Vikram}, title = {Chimeric U-Net - Modifying the standard U-Net towards Explainability}, volume = {338}, journal = {Artificial Intelligence}, doi = {10.1016/j.artint.2024.104240}, year = {2025}, abstract = {Healthcare guided by semantic segmentation has the potential to improve our quality of life through early and accurate disease detection. Convolutional Neural Networks, especially the U-Net-based architectures, are currently the state-of-the-art learning-based segmentation methods and have given unprecedented performances. However, their decision-making processes are still an active field of research. In order to reliably utilize such methods in healthcare, explainability of how the segmentation was performed is mandated. To date, explainability is studied and applied heavily in classification tasks. In this work, we propose the Chimeric U-Net, a U-Net architecture with an invertible decoder unit, that inherently brings explainability into semantic segmentation tasks. We find that having the restriction of an invertible decoder does not hinder the performance of the segmentation task. However, the invertible decoder helps to disentangle the class information in the latent space embedding and to construct meaningful saliency maps. Furthermore, we found that with a simple k-Nearest-Neighbours classifier, we could predict the Intersection over Union scores of unseen data, demonstrating that the latent space, constructed by the Chimeric U-Net , encodes an interpretable representation of the segmentation quality. Explainability is an emerging field, and in this work, we propose an alternative approach, that is, rather than building tools for explaining a generic architecture, we propose constraints on the architecture which induce explainability. With this approach, we could peer into the architecture to reveal its class correlations and local contextual dependencies, taking an insightful step towards trustworthy and reliable AI. Code to build and utilize the Chimeric U-Net is made available under: https://github.com/kenrickschulze/Chimeric-UNet---Half-invertible-UNet-in-Pytorch}, language = {en} } @article{SherrattSrivastavaAinslieetal.2024, author = {Sherratt, Katharine and Srivastava, Ajitesh and Ainslie, Kylie and Singh, David E. and Cublier, Aymar and Marinescu, Maria Cristina and Carretero, Jesus and Garcia, Alberto Cascajo and Franco, Nicolas and Willem, Lander and Abrams, Steven and Faes, Christel and Beutels, Philippe and Hens, Niel and M{\"u}ller, Sebastian and Charlton, Billy and Ewert, Ricardo and Paltra, Sydney and Rakow, Christian and Rehmann, Jakob and Conrad, Tim and Sch{\"u}tte, Christof and Nagel, Kai and Abbott, Sam and Grah, Rok and Niehus, Rene and Prasse, Bastian and Sandmann, Frank and Funk, Sebastian}, title = {Characterising information gains and losses when collecting multiple epidemic model outputs}, volume = {47}, journal = {Epidemics}, publisher = {Elsevier BV}, issn = {1755-4365}, doi = {10.1016/j.epidem.2024.100765}, year = {2024}, abstract = {Collaborative comparisons and combinations of epidemic models are used as policy-relevant evidence during epidemic outbreaks. In the process of collecting multiple model projections, such collaborations may gain or lose relevant information. Typically, modellers contribute a probabilistic summary at each time-step. We compared this to directly collecting simulated trajectories. We aimed to explore information on key epidemic quantities; ensemble uncertainty; and performance against data, investigating potential to continuously gain information from a single cross-sectional collection of model results. Methods We compared July 2022 projections from the European COVID-19 Scenario Modelling Hub. Five modelling teams projected incidence in Belgium, the Netherlands, and Spain. We compared projections by incidence, peaks, and cumulative totals. We created a probabilistic ensemble drawn from all trajectories, and compared to ensembles from a median across each model's quantiles, or a linear opinion pool. We measured the predictive accuracy of individual trajectories against observations, using this in a weighted ensemble. We repeated this sequentially against increasing weeks of observed data. We evaluated these ensembles to reflect performance with varying observed data. Results. By collecting modelled trajectories, we showed policy-relevant epidemic characteristics. Trajectories contained a right-skewed distribution well represented by an ensemble of trajectories or a linear opinion pool, but not models' quantile intervals. Ensembles weighted by performance typically retained the range of plausible incidence over time, and in some cases narrowed this by excluding some epidemic shapes. Conclusions. We observed several information gains from collecting modelled trajectories rather than quantile distributions, including potential for continuously updated information from a single model collection. The value of information gains and losses may vary with each collaborative effort's aims, depending on the needs of projection users. Understanding the differing information potential of methods to collect model projections can support the accuracy, sustainability, and communication of collaborative infectious disease modelling efforts. Data availability All code and data available on Github: https://github.com/covid19-forecast-hub-europe/aggregation-info-loss}, language = {en} } @article{GaskinConradPavliotisetal.2024, author = {Gaskin, Thomas and Conrad, Tim and Pavliotis, Grigorios A. and Sch{\"u}tte, Christof}, title = {Neural parameter calibration and uncertainty quantification for epidemic forecasting}, volume = {19}, journal = {PLOS ONE}, number = {10}, arxiv = {http://arxiv.org/abs/2312.03147}, doi = {10.1371/journal.pone.0306704}, year = {2024}, abstract = {The recent COVID-19 pandemic has thrown the importance of accurately forecasting contagion dynamics and learning infection parameters into sharp focus. At the same time, effective policy-making requires knowledge of the uncertainty on such predictions, in order, for instance, to be able to ready hospitals and intensive care units for a worst-case scenario without needlessly wasting resources. In this work, we apply a novel and powerful computational method to the problem of learning probability densities on contagion parameters and providing uncertainty quantification for pandemic projections. Using a neural network, we calibrate an ODE model to data of the spread of COVID-19 in Berlin in 2020, achieving both a significantly more accurate calibration and prediction than Markov-Chain Monte Carlo (MCMC)-based sampling schemes. The uncertainties on our predictions provide meaningful confidence intervals e.g. on infection figures and hospitalisation rates, while training and running the neural scheme takes minutes where MCMC takes hours. We show convergence of our method to the true posterior on a simplified SIR model of epidemics, and also demonstrate our method's learning capabilities on a reduced dataset, where a complex model is learned from a small number of compartments for which data is available.}, language = {en} } @article{KostreSunkaraSchuetteetal.2022, author = {Kostr{\´e}, Margarita and Sunkara, Vikram and Sch{\"u}tte, Christof and Djurdjevac Conrad, Natasa}, title = {Understanding the Romanization Spreading on Historical Interregional Networks in Northern Tunisia}, volume = {7}, journal = {Applied Network Science}, publisher = {Springer Nature}, doi = {10.1007/s41109-022-00492-w}, pages = {18}, year = {2022}, abstract = {Spreading processes are important drivers of change in social systems. To understand the mechanisms of spreading it is fundamental to have information about the underlying contact network and the dynamical parameters of the process. However, in many real-wold examples, this information is not known and needs to be inferred from data. State-of-the-art spreading inference methods have mostly been applied to modern social systems, as they rely on availability of very detailed data. In this paper we study the inference challenges for historical spreading processes, for which only very fragmented information is available. To cope with this problem, we extend existing network models by formulating a model on a mesoscale with temporal spreading rate. Furthermore, we formulate the respective parameter inference problem for the extended model. We apply our approach to the romanization process of Northern Tunisia, a scarce dataset, and study properties of the inferred time-evolving interregional networks. As a result, we show that (1) optimal solutions consist of very different network structures and spreading rate functions; and that (2) these diverse solutions produce very similar spreading patterns. Finally, we discuss how inferred dominant interregional connections are related to available archaeological traces. Historical networks resulting from our approach can help understanding complex processes of cultural change in ancient times.}, language = {en} } @misc{KostreSunkaraSchuetteetal.2022, author = {Kostr{\´e}, Margarita and Sunkara, Vikram and Sch{\"u}tte, Christof and Djurdjevac Conrad, Nataša}, title = {Understanding the Romanization Spreading on Historical Interregional Networks in Northern Tunisia}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-86764}, year = {2022}, abstract = {Spreading processes are important drivers of change in social systems. To understand the mechanisms of spreading it is fundamental to have information about the underlying contact network and the dynamical parameters of the process. However, in many real-wold examples, this information is not known and needs to be inferred from data. State-of-the-art spreading inference methods have mostly been applied to modern social systems, as they rely on availability of very detailed data. In this paper we study the inference challenges for historical spreading processes, for which only very fragmented information is available. To cope with this problem, we extend existing network models by formulating a model on a mesoscale with temporal spreading rate. Furthermore, we formulate the respective parameter inference problem for the extended model. We apply our approach to the romanization process of Northern Tunisia, a scarce dataset, and study properties of the inferred time-evolving interregional networks. As a result, we show that (1) optimal solutions consist of very different network structures and spreading rate functions; and that (2) these diverse solutions produce very similar spreading patterns. Finally, we discuss how inferred dominant interregional connections are related to available archaeological traces. Historical networks resulting from our approach can help understanding complex processes of cultural change in ancient times.}, language = {en} } @book{OPUS4-5024, title = {MATHEON - Mathematics for Key Technologies}, volume = {1}, 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}, isbn = {978-3-03719-137-8}, doi = {10.4171/137}, year = {2014}, language = {en} } @article{CardereraPokuttaSchuetteetal.2025, author = {Carderera, Alejandro and Pokutta, Sebastian and Sch{\"u}tte, Christof and Weiser, Martin}, title = {An efficient first-order conditional gradient algorithm in data-driven sparse identification of nonlinear dynamics to solve sparse recovery problems under noise}, volume = {470}, journal = {Journal of Computational and Applied Mathematics}, doi = {10.1016/j.cam.2025.116675}, year = {2025}, abstract = {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 framework, the new framework 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.}, language = {en} } @misc{ZhangSchuette2017, author = {Zhang, Wei and Sch{\"u}tte, Christof}, title = {Reliable approximation of long relaxation timescales in molecular dynamics}, issn = {1438-0064}, doi = {10.3390/e19070367}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-63718}, year = {2017}, abstract = {Many interesting rare events in molecular systems like ligand association, protein folding or con- formational changes happen on timescales that often are not accessible by direct numerical simulation. Therefore rare event approximation approaches like interface sampling, Markov state model building or advanced reaction coordinate based free energy estimation have attracted huge attention recently. In this article we analyze the reliability of such approaches: How precise is an estimate of long relaxation timescales of molecular systems resulting from various forms of rare event approximation methods? Our results give a theoretical answer to this question by relating it with the transfer operator approach to molecular dynamics. By doing so they also allow for understanding deep connections between the different approaches.}, language = {en} } @article{HartmannSchuetteZhang2019, author = {Hartmann, Carsten and Sch{\"u}tte, Christof and Zhang, Wei}, title = {Jarzynski's equality, fluctuation theorems, and variance reduction: Mathematical analysis and numerical algorithms}, volume = {175}, journal = {Journal of Statistical Physics}, number = {6}, arxiv = {http://arxiv.org/abs/1803.09347}, doi = {10.1007/s10955-019-02286-4}, pages = {1214 -- 1261}, year = {2019}, abstract = {In this paper, we study Jarzynski's equality and fluctuation theorems for diffusion processes. While some of the results considered in the current work are known in the (mainly physics) literature, we review and generalize these nonequilibrium theorems using mathematical arguments, therefore enabling further investigations in the mathematical community. On the numerical side, variance reduction approaches such as importance sampling method are studied in order to compute free energy differences based on Jarzynski's equality.}, language = {en} } @article{ZhangLiSchuette2022, author = {Zhang, Wei and Li, Tiejun and Sch{\"u}tte, Christof}, title = {Solving eigenvalue PDEs of metastable diffusion processes using artificial neural networks}, volume = {465}, journal = {Journal of Computational Physics}, arxiv = {http://arxiv.org/abs/2110.14523}, doi = {10.1016/j.jcp.2022.111377}, year = {2022}, abstract = {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 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.}, language = {en} } @article{ZhangKlusConradetal.2019, author = {Zhang, Wei and Klus, Stefan and Conrad, Tim and Sch{\"u}tte, Christof}, title = {Learning chemical reaction networks from trajectory data}, volume = {18}, journal = {SIAM Journal on Applied Dynamical Systems (SIADS)}, number = {4}, arxiv = {http://arxiv.org/abs/1902.04920}, doi = {10.1137/19M1265880}, pages = {2000 -- 2046}, year = {2019}, abstract = {We develop a data-driven method to learn chemical reaction networks from trajectory data. Modeling the reaction system as a continuous-time Markov chain and assuming the system is fully observed,our method learns the propensity functions of the system with predetermined basis functions by maximizing the likelihood function of the trajectory data under l^1 sparse regularization. We demonstrate our method with numerical examples using synthetic data and carry out an asymptotic analysis of the proposed learning procedure in the infinite-data limit.}, language = {en} } @article{AkhyarZhangStoltzetal.2025, author = {Akhyar, Fatima-Zahrae and Zhang, Wei and Stoltz, Gabriel and Sch{\"u}tte, Christof}, title = {Generative modeling of conditional probability distributions on the level-sets of collective variables}, arxiv = {http://arxiv.org/abs/2512.17374}, year = {2025}, abstract = {Given a probability distribution \$\mu\$ in \$\mathbb{R}^d\$ represented by data, we study in this paper the generative modeling of its conditional probability distributions on the level-sets of a collective variable \$\xi: \mathbb{R}^d \rightarrow \mathbb{R}^k\$, where \$1 \le k