Large population limits of Markov processes on random networks
From MaRDI portal
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 ErdH{o}s-R'enyi 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.
Recommendations
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Mean-field limits beyond ordinary differential equations
- Mean field interaction on random graphs with dynamically changing multi-color edges
- A note on dynamical models on random graphs and Fokker-Planck equations
- Interacting stochastic processes on sparse random graphs
Cites work
- A note on dynamical models on random graphs and Fokker-Planck equations
- A probabilistic algorithm for aggregating vastly undersampled large Markov chains
- Agent-based modeling: population limits and large timescales
- Computational Complexity
- Consensus and voting on large graphs: an application of graph limit theory
- Dynamical response of networks under external perturbations: exact results
- Dynamical systems on networks. A tutorial
- Epidemic spread in networks: existing methods and current challenges
- Ergodic theorems for weakly interacting infinite systems and the voter model
- Exact epidemic models on graphs using graph-automorphism driven lumping
- Graphop mean-field limits for Kuramoto-type models
- scientific article; zbMATH DE number 3148873 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- Hydrodynamics of the voter model
- Large graph limit for an SIR process in random network with heterogeneous connectivity
- Large networks and graph limits
- Local-density dependent Markov processes on graphons with epidemiological applications
- Mathematics of epidemics on networks. From exact to approximate models
- Mean field limits for non-Markovian interacting particles: convergence to equilibrium, generic formalism, asymptotic limits and phase transitions
- Mean-field analysis of the \(q\)-voter model on networks
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Mean-field limit of collective dynamics with time-varying weights
- Nonlinear Markov processes and kinetic equations.
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- Sandwiching random graphs: universality between random graph models
- SIR dynamics in random networks with heterogeneous connectivity
- Stochastic dynamics in computational biology
- Strong approximation theorems for density dependent Markov chains
- The nonlinear heat equation on dense graphs and graph limits
- The zealot voter model
- Weakly interacting particle systems on inhomogeneous random graphs
Cited in
(2)
This page was built for publication: Large population limits of Markov processes on random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144437)
