Learning Interpretable Collective Variables for Spreading Processes on Networks

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 work, 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.

References in corpus (9)

• Statistical physics of social dynamics
• Phase transition in the detection of modules in sparse networks
• Adaptive networks: coevolution of disease and topology
• Conservation laws for the voter model in complex networks
• Analytical Solution of the Voter Model on Disordered Networks
• Nonlinear Discovery of Slow Molecular Modes using State-Free Reversible VAMPnets
• Nonparametric forecasting of low-dimensional dynamical systems
• (Un)detectable cluster structure in sparse networks
• Large population limits of Markov processes on random networks