Refine
Document Type
- Article (2)
- In Proceedings (1)
Language
- English (3)
Has Fulltext
- no (3)
Is part of the Bibliography
- no (3)
Institute
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.
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.
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.