Large population limits of Markov processes on random networks
arXiv:2210.02934 · 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ényi random graphs, on the stochastic block model, and on random regular graphs. Moreover, a heterogeneous population of agents is studied.
References in corpus (20)
- Statistical physics of social dynamics
- Nonequilibrium phase transition in the coevolution of networks and opinions
- Analytical results for the Sznajd model of opinion formation
- The noisy voter model on complex networks
- Large graph limit for an SIR process in random network with heterogeneous connectivity
- Zealots in the mean-field noisy voter model
- Heterogeneous pair approximation for voter models on networks
- Mean-field analysis of the q-voter model on networks
- A note on dynamical models on random graphs and Fokker-Planck equations
- Stochastic pair approximation treatment of the noisy voter model
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Pair approximation for the noisy threshold -voter model
- Graphon mean field systems
- Data-driven model reduction of agent-based systems using the Koopman generator
- Statistical Analysis of Tipping Pathways in Agent-Based Models
- Binary dynamics on star networks under external perturbations
- Consensus and Voting on Large Graphs: An Application of Graph Limit Theory
- Majority Dynamics: The Power of One
- Markov processes on quasi-random graphs
- Hydrodynamic Limits of non-Markovian Interacting Particle Systems on Sparse Graphs