TY - JOUR A1 - Lücke, Marvin A1 - Winkelmann, Stefanie A1 - Koltai, Peter T1 - An accurate mean-field equation for voter model dynamics on scale-free networks N2 - Understanding the emergent macroscopic behavior of dynamical systems on networks is a crucial but challenging task. One of the simplest and most effective methods to construct a reduced macroscopic model is given by mean-field theory. The resulting approximations perform well on dense and homogeneous networks but poorly on scale-free networks, which, however, are more realistic in many applications. In this paper, we introduce a modified version of the mean-field approximation for voter model dynamics on scale-free networks. The two main deviations from classical theory are that we use degree-weighted shares as coarse variables and that we introduce a correlation factor that can be interpreted as slowing down dynamics induced by interactions. We observe that the correlation factor is only a property of the network and not of the state or of parameters of the process. This approach achieves a significantly smaller approximation error than standard methods without increasing dimensionality. Y1 - 2025 ER - TY - CHAP A1 - Lücke, Marvin A1 - Koltai, Peter A1 - Winkelmann, Stefanie A1 - Molkethin, Nora A1 - Heitzig, Jobst T1 - Discovering collective variable dynamics of agent-based models T2 - 25th International Symposium on Mathematical Theory of Networks and Systems MTNS 2022 N2 - 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. Y1 - 2022 U6 - https://doi.org/https://doi.org/10.15495/EPub_UBT_00006809 ER - TY - JOUR A1 - Lücke, Marvin A1 - Winkelmann, Stefanie A1 - Heitzig, Jobst A1 - Molkenthin, Nora A1 - Koltai, Péter T1 - Learning interpretable collective variables for spreading processes on networks JF - Physical Review E N2 - 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ási model. Our results deliver evidence for the existence of low-dimensional CVs even in cases that are not yet understood theoretically. Y1 - 2024 U6 - https://doi.org/10.1103/PhysRevE.109.L022301 VL - 109 IS - 2 SP - L022301 ER - TY - JOUR A1 - Lücke, Marvin A1 - Heitzig, Jobst A1 - Koltai, Péter A1 - Molkethin, Nora A1 - Winkelmann, Stefanie T1 - Large population limits of Markov processes on random networks JF - Stochastic Processes and their Applications N2 - 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é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. Y1 - 2023 U6 - https://doi.org/10.1016/j.spa.2023.09.007 VL - 166 ER -