@misc{KoltaiSchuette, author = {Koltai, P{\´e}ter and Sch{\"u}tte, Christof}, title = {A multi scale perturbation expansion approach for Markov state modeling of non-stationary molecular dynamics}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-64868}, abstract = {We investigate metastable dynamical systems subject to non-stationary forcing as they appear in molecular dynamics for systems driven by external fields. We show, that if the strength of the forcing is inversely proportional to the length of the slow metastable time scales of the unforced system, then the effective behavior of the forced system on slow time scales can be described by a low-dimensional reduced master equation. Our construction is explicit and uses the multiscale perturbation expansion method called two-timing, or method of multiple scales. The reduced master equation—a Markov state model—can be assembled by constructing two equilibrium Markov state models; one for the unforced system, and one for a slightly perturbed one.}, language = {en} } @article{LueckeWinkelmannHeitzigetal., author = {L{\"u}cke, Marvin and Winkelmann, Stefanie and Heitzig, Jobst and Molkenthin, Nora and Koltai, P{\´e}ter}, title = {Learning interpretable collective variables for spreading processes on networks}, series = {Physical Review E}, volume = {109}, journal = {Physical Review E}, number = {2}, doi = {10.1103/PhysRevE.109.L022301}, pages = {L022301}, abstract = {Collective variables (CVs) are low-dimensional projections of high-dimensional system states. They are used to gain insights into complex emergent dynamical behaviors of processes on networks. The relation between CVs and network measures is not well understood and its derivation typically requires detailed knowledge of both the dynamical system and the network topology. In this Letter, we present a data-driven method for algorithmically learning and understanding CVs for binary-state spreading processes on networks of arbitrary topology. We demonstrate our method using four example networks: the stochastic block model, a ring-shaped graph, a random regular graph, and a scale-free network generated by the Albert-Barab{\´a}si model. Our results deliver evidence for the existence of low-dimensional CVs even in cases that are not yet understood theoretically.}, language = {en} } @inproceedings{LueckeKoltaiWinkelmannetal., author = {L{\"u}cke, Marvin and Koltai, Peter and Winkelmann, Stefanie and Molkethin, Nora and Heitzig, Jobst}, title = {Discovering collective variable dynamics of agent-based models}, series = {25th International Symposium on Mathematical Theory of Networks and Systems MTNS 2022}, booktitle = {25th International Symposium on Mathematical Theory of Networks and Systems MTNS 2022}, doi = {https://doi.org/10.15495/EPub_UBT_00006809}, abstract = {Analytical approximations of the macroscopic behavior of agent-based models (e.g. via mean-field theory) often introduce a significant error, especially in the transient phase. For an example model called continuous-time noisy voter model, we use two data-driven approaches to learn the evolution of collective variables instead. The first approach utilizes the SINDy method to approximate the macroscopic dynamics without prior knowledge, but has proven itself to be not particularly robust. The second approach employs an informed learning strategy which includes knowledge about the agent-based model. Both approaches exhibit a considerably smaller error than the conventional analytical approximation.}, language = {en} }