Mean-field limit of non-exchangeable systems
arXiv:2112.15406 · doi:10.1002/cpa.22235
Abstract
This paper deals with the derivation of the mean-field limit for multi-agent systems on a large class of sparse graphs. More specifically, the case of non-exchangeable multi-agent systems consisting of non-identical agents is addressed. The analysis does not only involve PDEs and stochastic analysis but also graph theory through a new concept of limits of sparse graphs (extended graphons) that reflect the structure of the connectivities in the network and has critical effects on the collective dynamics. In this article some of the main restrictive hypothesis in the previous literature on the connectivities between the agents (dense graphs) and the cooperation between them (symmetric interactions) are removed.
References in corpus (14)
- Emergence of scaling in random networks
- Quantitative estimate of propagation of chaos for stochastic systems with kernels
- An theory of sparse graph convergence I: limits, sparse random graph models, and power law distributions
- Global solvability of a networked integrate-and-fire model of McKean-Vlasov type
- Hydrodynamic limit for interacting neurons
- Euler-type equations and commutators in singular and hyperbolic limits of kinetic Cucker-Smale models
- Hierarchies, entropy, and quantitative propagation of chaos for mean field diffusions
- The continuum limit of the Kuramoto model on sparse random graphs
- An theory of sparse graph convergence II: LD convergence, quotients, and right convergence
- A note on dynamical models on random graphs and Fokker-Planck equations
- Bifurcations in the Kuramoto model on graphs
- A Law of Large Numbers and Large Deviations for interacting diffusions on Erdős-Rényi graphs
- Filippov trajectories and clustering in the Kuramoto model with singular couplings
- Scaling of a large-scale simulation of synchronous slow-wave and asynchronous awake-like activity of a cortical model with long-range interconnections