Weakly interacting oscillators on dense random graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Weakly interacting oscillators on dense random graphs

Résumé

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. The limit is shown to be the solution to a non-linear Fokker-Planck equation weighted by the (possibly random) graph limit. No regularity assumptions are made on the graphon limit so that our analysis allows for very general graph sequences, such as exchangeable random graphs. For these, we also prove a propagation of chaos result. Finally, we fully characterize the graph sequences for which the associated empirical measure converges to the mean-field limit, i.e., to the solution of the classical McKean-Vlasov equation.
Fichier principal
Vignette du fichier
IIPS_110620.pdf (375.65 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02870131 , version 1 (16-06-2020)

Identifiants

  • HAL Id : hal-02870131 , version 1

Citer

Gianmarco Bet, Fabio Coppini, Francesca Nardi. Weakly interacting oscillators on dense random graphs. 2020. ⟨hal-02870131⟩
58 Consultations
31 Téléchargements

Partager

Gmail Facebook X LinkedIn More