@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} } @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