Network Dynamics on Graphops

Abstract

In this brief note, we report a formal mathematical observation: we are about to breach a major century-old barrier in the analysis of interacting particle systems. More precisely, it is well-known that in well-mixed/homogeneous/all-to-all-coupled systems, one may derive mean-field limit equations such as Vlasov-Fokker-Planck equations (VFPEs). A mesoscopic VFPE describes the probability of finding a single vertex/particle in a certain state, forming a bridge between microscopic statistical physics and macroscopic fluid-type approximations. One major obstacle in this framework is to incorporate complex network structures into limiting equations. In many cases, only heuristic approximations exist, or the limits rely on particular classes of integral operators. In this paper, we notice that there is a much more elegant, and profoundly more general, way available due to recent progress in the theory of graph limits. In particular, we show how one may easily enter complex network dynamics via graphops (graph operators) into VFPEs.

preprint; comments and suggestions welcome!

References in corpus (1)

• Complex networks in climate dynamics - Comparing linear and nonlinear network construction methods

Cited by in corpus (8)

• Multi-Population Phase Oscillator Networks with Higher-Order Interactions
• First-order like phase transition induced by quenched coupling disorder
• Dynamical Systems on Graph Limits and Their Symmetries
• Graphop Mean-Field Limits and Synchronization for the Stochastic Kuramoto Model
• Response Theory Identifies Reaction Coordinates and Explains Critical Phenomena in Noisy Interacting Systems
• Co-evolving networks for opinion and social dynamics in agent-based models
• Large Deviations of Non-Stochastic Interacting Particles on Sparse Random Graphs
• Mean field limits of co-evolutionary signed heterogeneous networks