Weakly interacting oscillators on dense random graphs
arXiv:2006.07670 · doi:10.1017/jpr.2023.34
Abstract
We consider a class of weakly interacting particle systems of mean-field type. The interactions between the particles are encoded in a graph sequence, i.e., two particles are interacting if and only if they are connected in the underlying graph. We establish a Law of Large Numbers for the empirical measure of the system that holds whenever the graph sequence is convergent in the sense of graph limits theory, i.e., to a graphon. The limit is shown to be the solution of a non-linear Fokker-Planck equation weighted by the (possibly random) graphon limit. In contrast with the existing literature, our analysis focuses on unlabeled graphons: no regularity assumptions are made on the graph limit and we are able to include general graph sequences such as exchangeable random graphs. Finally, we identify the sequences of graphs, both random and deterministic, for which the associated empirical measure converges to the mean-field limit, i.e., to the solution of a classical McKean-Vlasov equation.
arXiv comment26 pages
References in corpus (12)
- Synchronization in complex networks
- The Kuramoto model in complex networks
- Graph limits and exchangeable random graphs
- Dynamical aspects of mean field plane rotators and the Kuramoto model
- The continuum limit of the Kuramoto model on sparse random graphs
- Mean field limit for disordered diffusions with singular interactions
- A note on dynamical models on random graphs and Fokker-Planck equations
- Interacting diffusions on random graphs with diverging degrees: hydrodynamics and large deviations
- A Law of Large Numbers and Large Deviations for interacting diffusions on Erdős-Rényi graphs
- Graphon mean field systems
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Large subgraphs in pseudo-random graphs