Graphop mean-field limits for Kuramoto-type models
From MaRDI portal
Existence problems for PDEs: global existence, local existence, non-existence (35A01) Uniqueness problems for PDEs: global uniqueness, local uniqueness, non-uniqueness (35A02) Weak solutions to PDEs (35D30) Vlasov equations (35Q83) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) Dynamical systems involving maps of trees and graphs (37E25) Fourier and Fourier-Stieltjes transforms on locally compact and other abelian groups (43A25) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Interacting particle systems in time-dependent statistical mechanics (82C22)
Abstract: Originally arising in the context of interacting particle systems in statistical physics, dynamical systems and differential equations on networks/graphs have permeated into a broad number of mathematical areas as well as into many applications. One central problem in the field is to find suitable approximations of the dynamics as the number of nodes/vertices tends to infinity, i.e., in the large graph limit. A cornerstone in this context are Vlasov-Fokker-Planck equations (VFPEs) describing a particle density on a mean-field level. For all-to-all coupled systems, it is quite classical to prove the rigorous approximation by VFPEs for many classes of particle systems. For dense graphs converging to graphon limits, one also knows that mean-field approximation holds for certain classes of models, e.g., for the Kuramoto model on graphs. Yet, the space of intermediate density and sparse graphs is clearly extremely relevant. Here we prove that the Kuramoto model can be be approximated in the mean-field limit by far more general graph limits than graphons. In particular, our contributions are as follows. (I) We show, how to introduce operator theory more abstractly into VFPEs by considering graphops. Graphops have recently been proposed as a unifying approach to graph limit theory, and here we show that they can be used for differential equations on graphs. (II) For the Kuramoto model on graphs we rigorously prove that there is a VFPE equation approximating it in the mean-field sense. (III) This mean-field VFPE involves a graphop, and we prove the existence, uniqueness, and continuous graphop-dependence of weak solutions. (IV) On a technical level, our results rely on designing a new suitable metric of graphop convergence and on employing Fourier analysis on compact abelian groups to approximate graphops using summability kernels.
Recommendations
- The mean field equation for the Kuramoto model on graph sequences with non-Lipschitz limit
- The continuum limit of the Kuramoto model on sparse random graphs
- The mean field analysis of the Kuramoto model on graphs. I: The mean field equation and transition point formulas
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Vlasov equations on digraph measures
Cites work
- A partition of the unit sphere into regions of equal area and small diameter
- Diameter bounds for equal area partitions of the unit sphere
- From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
- Graphons, cut norm and distance, couplings and rearrangements
- scientific article; zbMATH DE number 3920139 (Why is no real title available?)
- scientific article; zbMATH DE number 3524004 (Why is no real title available?)
- scientific article; zbMATH DE number 2107175 (Why is no real title available?)
- Large networks and graph limits
- Limits of dense graph sequences
- On Choosing and Bounding Probability Metrics
- On large‐girth regular graphs and random processes on trees
- On the Vlasov Limit for Systems of Nonlinearly Coupled Oscillators without Noise
- Power network dynamics on graphons
- Probability theory. A comprehensive course
- Synchronization of globally coupled phase oscillators: singularities and scaling for general couplings
- The mean field analysis of the Kuramoto model on graphs. I: The mean field equation and transition point formulas
- The mean field equation for the Kuramoto model on graph sequences with non-Lipschitz limit
- The nonlinear heat equation on \(W\)-random graphs
- The semilinear heat equation on sparse random graphs
Cited in
(19)- Mean-field and graph limits for collective dynamics models with time-varying weights
- Vlasov equations on digraph measures
- Long time dynamics for interacting oscillators on graphs
- Multi-population phase oscillator networks with higher-order interactions
- The mean field equation for the Kuramoto model on graph sequences with non-Lipschitz limit
- Adaptive dynamical networks
- Large population limits of Markov processes on random networks
- First-order like phase transition induced by quenched coupling disorder
- Graphop mean-field limits and synchronization for the stochastic Kuramoto model
- Evolution equations on co-evolving graphs: long-time behaviour and the graph-continuity equation
- Mean-field limits for stochastic interacting particles via digraph measures
- Persistence of steady states for dynamical systems on large networks
- Dynamical systems on graph limits and their symmetries
- Vlasov equations on directed hypergraph measures
- Mean-field limit of non-exchangeable systems
- The mean-field limit of sparse networks of integrate-and-fire neurons
- Mean field limits of co-evolutionary signed heterogeneous networks
- Global stability for McKean-Vlasov equations on large networks
- A framework for continuum modeling of opinion dynamics on a network based on the probability of connections
This page was built for publication: Graphop mean-field limits for Kuramoto-type models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024520)
