@article{LueckeNueske, author = {L{\"u}cke, Marvin and N{\"u}ske, Feliks}, title = {tgEDMD: Approximation of the Kolmogorov Operator in Tensor Train Format}, series = {Journal of Nonlinear Science}, volume = {32}, journal = {Journal of Nonlinear Science}, doi = {10.1007/s00332-022-09801-0}, abstract = {Extracting information about dynamical systems from models learned off simulation data has become an increasingly important research topic in the natural and engineering sciences. Modeling the Koopman operator semigroup has played a central role in this context. As the approximation quality of any such model critically depends on the basis set, recent work has focused on deriving data-efficient representations of the Koopman operator in low-rank tensor formats, enabling the use of powerful model classes while avoiding over-fitting. On the other hand, detailed information about the system at hand can be extracted from models for the infinitesimal generator, also called Kolmogorov backward operator for stochastic differential equations. In this work, we present a data-driven method to efficiently approximate the generator using the tensor train (TT) format. The centerpiece of the method is a TT representation of the tensor of generator evaluations at all data sites. We analyze consistency and complexity of the method, present extensions to practically relevant settings, and demonstrate its applicability to benchmark numerical examples.}, language = {en} } @article{LueckeHeitzigKoltaietal., author = {L{\"u}cke, Marvin and Heitzig, Jobst and Koltai, P{\´e}ter and Molkethin, Nora and Winkelmann, Stefanie}, title = {Large population limits of Markov processes on random networks}, series = {Stochastic Processes and their Applications}, volume = {166}, journal = {Stochastic Processes and their Applications}, doi = {10.1016/j.spa.2023.09.007}, abstract = {We consider time-continuous Markovian discrete-state dynamics on random networks of interacting agents and study the large population limit. The dynamics are projected onto low-dimensional collective variables given by the shares of each discrete state in the system, or in certain subsystems, and general conditions for the convergence of the collective variable dynamics to a mean-field ordinary differential equation are proved. We discuss the convergence to this mean-field limit for a continuous-time noisy version of the so-called "voter model" on Erdős-R{\´e}nyi random graphs, on the stochastic block model, as well as on random regular graphs. Moreover, a heterogeneous population of agents is studied. For each of these types of interaction networks, we specify the convergence conditions in dependency on the corresponding model parameters.}, language = {en} } @article{LueckeLuQuevedo, author = {L{\"u}cke, Marvin and Lu, Jingyi and Quevedo, Daniel E.}, title = {Coding for secrecy in remote state estimation with an adversary}, series = {IEEE Transactions on Automatic Control}, volume = {67}, journal = {IEEE Transactions on Automatic Control}, number = {9}, doi = {10.1109/TAC.2022.3169839}, pages = {4955 -- 4962}, abstract = {We study the problem of remote state estimation in the presence of an eavesdropper. A sensor transmits state information over a packet-dropping link to a legitimate user. This information is randomly overheard by an eavesdropper. To reduce information leakage to the eavesdropper, previous studies have shown that by encoding the estimate with the acknowledgments (Acks), perfect secrecy can be achieved. However, this strategy greatly relies on the accuracy of the Acks and may easily fail if the Acks are compromised by cyberattacks. In this article, we tackle this issue by proposing to switch between sending an encoded state and sending the plain state to stay resilient against fake Acks. Specifically, we assume the Acks to be randomly attacked and derive recursive expressions for the minimum-mean-squared error estimates and error covariance matrices at the legitimate user and at the eavesdropper. Based upon this, we propose a transmission policy that depends on the probability of synchronization. We formulate a partially observable Markov decision process to model the evolution of the synchronization status and derive associated optimal transmission policies. Numerical examples are provided to verify the theoretical results.}, language = {en} } @article{DellnitzHuellermeierLueckeetal., author = {Dellnitz, Michael and H{\"u}llermeier, Eyke and L{\"u}cke, Marvin and Ober-Bl{\"o}baum, Sina and Offen, Christian and Peitz, Sebastian and Pfannschmidt, Karlson}, title = {Efficient Time-Stepping for Numerical Integration Using Reinforcement Learning}, series = {SIAM Journal on Scientific Computing}, volume = {45}, journal = {SIAM Journal on Scientific Computing}, number = {2}, doi = {10.1137/21M1412682}, pages = {A579 -- A595}, 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} }