@article{KlusKoltaiSchuette2016, author = {Klus, Stefan and Koltai, Peter and Sch{\"u}tte, Christof}, title = {On the numerical approximation of the Perron-Frobenius and Koopman operator}, volume = {3}, journal = {Journal of Computational Dynamics}, number = {1}, doi = {10.3934/jcd.2016003}, pages = {51 -- 77}, year = {2016}, abstract = {Information about the behavior of dynamical systems can often be obtained by analyzing the eigenvalues and corresponding eigenfunctions of linear operators associated with a dynamical system. Examples of such operators are the Perron-Frobenius and the Koopman operator. In this paper, we will review di� fferent methods that have been developed over the last decades to compute � infinite-dimensional approximations of these in� finite-dimensional operators - in particular Ulam's method and Extended Dynamic Mode Decomposition (EDMD) - and highlight the similarities and di� fferences between these approaches. The results will be illustrated using simple stochastic di� fferential equations and molecular dynamics examples.}, language = {en} } @article{KlusNueskeKoltaietal.2018, author = {Klus, Stefan and N{\"u}ske, Feliks and Koltai, Peter and Wu, Hao and Kevrekidis, Ioannis and Sch{\"u}tte, Christof and No{\´e}, Frank}, title = {Data-driven model reduction and transfer operator approximation}, volume = {28}, journal = {Journal of Nonlinear Science}, number = {3}, doi = {10.1007/s00332-017-9437-7}, pages = {985 -- 1010}, year = {2018}, language = {en} } @article{KlusGelssPeitzetal.2018, author = {Klus, Stefan and Gelß, Patrick and Peitz, Sebastian and Sch{\"u}tte, Christof}, title = {Tensor-based dynamic mode decomposition}, volume = {31}, journal = {Nonlinearity}, number = {7}, publisher = {IOP Publishing Ltd \& London Mathematical Society}, doi = {10.1088/1361-6544/aabc8f}, year = {2018}, language = {en} } @misc{BittracherKoltaiKlusetal.2017, author = {Bittracher, Andreas and Koltai, P{\´e}ter and Klus, Stefan and Banisch, Ralf and Dellnitz, Michael and Sch{\"u}tte, Christof}, title = {Transition manifolds of complex metastable systems: Theory and data-driven computation of effective dynamics}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-63822}, year = {2017}, abstract = {We consider complex dynamical systems showing metastable behavior but no local separation of fast and slow time scales. The article raises the question of whether such systems exhibit a low-dimensional manifold supporting its effective dynamics. For answering this question, we aim at finding nonlinear coordinates, called reaction coordinates, such that the projection of the dynamics onto these coordinates preserves the dominant time scales of the dynamics. We show that, based on a specific reducibility property, the existence of good low-dimensional reaction coordinates preserving the dominant time scales is guaranteed. Based on this theoretical framework, we develop and test a novel numerical approach for computing good reaction coordinates. The proposed algorithmic approach is fully local and thus not prone to the curse of dimension with respect to the state space of the dynamics. Hence, it is a promising method for data-based model reduction of complex dynamical systems such as molecular dynamics.}, 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} } @article{KlusGelss2025, author = {Klus, Stefan and Gelß, Patrick}, title = {Continuous optimization methods for the graph isomorphism problem}, volume = {14}, journal = {Information and Inference: A Journal of the IMA}, number = {2}, doi = {10.1093/imaiai/iaaf011}, year = {2025}, language = {en} } @article{TrowerDjurdjevacConradKlus2025, author = {Trower, Maia and Djurdjevac Conrad, Natasa and Klus, Stefan}, title = {Clustering Time-Evolving Networks Using the Spatiotemporal Graph Laplacian}, volume = {35}, journal = {Chaos: An Interdisciplinary Journal of Nonlinear Science}, arxiv = {http://arxiv.org/abs/2407.12864}, doi = {10.1063/5.0228419}, pages = {013126}, year = {2025}, abstract = {Time-evolving graphs arise frequently when modeling complex dynamical systems such as social networks, traffic flow, and biological processes. Developing techniques to identify and analyze communities in these time-varying graph structures is an important challenge. In this work, we generalize existing spectral clustering algorithms from static to dynamic graphs using canonical correlation analysis (CCA) to capture the temporal evolution of clusters. Based on this extended canonical correlation framework, we define the spatio-temporal graph Laplacian and investigate its spectral properties. We connect these concepts to dynamical systems theory via transfer operators, and illustrate the advantages of our method on benchmark graphs by comparison with existing methods. We show that the spatio-temporal graph Laplacian allows for a clear interpretation of cluster structure evolution over time for directed and undirected graphs.}, language = {en} } @article{KlusDjurdjevacConrad2024, author = {Klus, Stefan and Djurdjevac Conrad, Natasa}, title = {Dynamical systems and complex networks: A Koopman operator perspective}, volume = {5}, journal = {Journal of Physics: Complexity}, number = {4}, publisher = {IOP Publishing}, arxiv = {http://arxiv.org/abs/2405.08940}, doi = {10.1088/2632-072X/ad9e60}, pages = {041001}, year = {2024}, abstract = {The Koopman operator has entered and transformed many research areas over the last years. Although the underlying concept-representing highly nonlinear dynamical systems by infinite-dimensional linear operators-has been known for a long time, the availability of large data sets and efficient machine learning algorithms for estimating the Koopman operator from data make this framework extremely powerful and popular. Koopman operator theory allows us to gain insights into the characteristic global properties of a system without requiring detailed mathematical models. We will show how these methods can also be used to analyze complex networks and highlight relationships between Koopman operators and graph Laplacians.}, language = {en} } @article{StenglGelssKlusetal.2024, author = {Stengl, Steven-Marian and Gelß, Patrick and Klus, Stefan and Pokutta, Sebastian}, title = {Existence and uniqueness of solutions of the Koopman--von Neumann equation on bounded domains}, volume = {57}, journal = {Journal of Physics A: Mathematical and Theoretical}, number = {39}, doi = {10.1088/1751-8121/ad6f7d}, year = {2024}, language = {en} } @article{BlaskovicConradKlusetal.2025, author = {Blaskovic, Filip and Conrad, Tim and Klus, Stefan and Djurdjevac Conrad, Natasa}, title = {Random walk based snapshot clustering for detecting community dynamics in temporal networks}, volume = {15}, journal = {Scientific Reports}, arxiv = {http://arxiv.org/abs/2412.12187}, doi = {10.1038/s41598-025-09340-0}, pages = {24414}, year = {2025}, abstract = {The evolution of many dynamical systems that describe relationships or interactions between objects can be effectively modeled by temporal networks, which are typically represented as a sequence of static network snapshots. In this paper, we introduce a novel random walk based approach that can identify clusters of time-snapshots in which network community structures are stable. This allows to detect significant structural shifts over time, such as the splitting, merging, birth, or death of communities. We also provide a low-dimensional representation of entire snapshots, placing those with similar community structure close to each other in the feature space. To validate our approach, we develop an agent-based algorithm that generates synthetic datasets with the desired characteristic properties, enabling thorough testing and benchmarking. We further demonstrate the effectiveness and broad applicability of our technique by testing it on various social dynamics models and real-world datasets and comparing its performance to several state-of-the-art algorithms. Our findings highlight the strength of our approach to correctly capture and analyze the dynamics of complex systems.}, language = {en} }