Weakly interacting oscillators on dense random graphs
From MaRDI portal
exchangeable graphsFokker-Planck equationinteracting oscillatorsMcKean-Vlasovmean-field systemsrandom graphons
Random graphs (graph-theoretic aspects) (05C80) Fokker-Planck equations (35Q84) Stochastic integral equations (60H20) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
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.
Recommendations
Cites work
- A law of large numbers and large deviations for interacting diffusions on Erdős-Rényi graphs
- A martingale approach to the law of large numbers for weakly interacting stochastic processes
- A note on dynamical models on random graphs and Fokker-Planck equations
- Approximating the Cut-Norm via Grothendieck's Inequality
- Big jobs arrive early: from critical queues to random graphs
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Dynamical aspects of mean field plane rotators and the Kuramoto model
- Gibbsianness versus non-Gibbsianness of time-evolved planar rotor models
- Graph limits and exchangeable random graphs
- scientific article; zbMATH DE number 4211245 (Why is no real title available?)
- scientific article; zbMATH DE number 2107175 (Why is no real title available?)
- Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations
- Long time dynamics for interacting oscillators on graphs
- Mean field limit for disordered diffusions with singular interactions
- Quasi-random graphs
- Quenched asymptotics for interacting diffusions on inhomogeneous random graphs
- Stochastic graphon games. I: The static case
- The continuum limit of the Kuramoto model on sparse random graphs
- The Kuramoto model in complex networks
- The mean field analysis of the Kuramoto model on graphs. I: The mean field equation and transition point formulas
- Weakly interacting particle systems on inhomogeneous random graphs
Cited in
(8)- Interacting stochastic processes on sparse random graphs
- Graphon mean field systems
- Stochastic optimization on matrices and a graphon McKean-Vlasov limit
- Nonlinear graphon mean-field systems
- The mean-field limit of sparse networks of integrate-and-fire neurons
- Mean-field limit of nonexchangeable interacting diffusions with singular kernels
- Stochastic graphon games with jumps and approximate Nash equilibria
- Inverse graph limit problem of the graphon multi-agent systems
This page was built for publication: Weakly interacting oscillators on dense random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198976)
