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 to a graphon. The limit is 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 both deterministic and random 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 classical McKean–Vlasov mean-field limit.

Weakly interacting oscillators on dense random graphs / Gianmarco Bet; Fabio Coppini; Francesca R. Nardi. - In: JOURNAL OF APPLIED PROBABILITY. - ISSN 0021-9002. - ELETTRONICO. - (2023), pp. 1-25. [10.1017/jpr.2023.34]

Weakly interacting oscillators on dense random graphs

Gianmarco Bet
Membro del Collaboration Group
;
Fabio Coppini
Membro del Collaboration Group
;
Francesca R. Nardi
Membro del Collaboration Group
2023

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 to a graphon. The limit is 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 both deterministic and random 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 classical McKean–Vlasov mean-field limit.
2023
1
25
Goal 17: Partnerships for the goals
Gianmarco Bet; Fabio Coppini; Francesca R. Nardi
File in questo prodotto:
File Dimensione Formato  
BCNVersioneArchive.pdf

accesso aperto

Descrizione: Articolo principale
Tipologia: Altro
Licenza: Open Access
Dimensione 269.67 kB
Formato Adobe PDF
269.67 kB Adobe PDF
weakly-interacting-oscillators-on-dense-random-graphs.pdf

Accesso chiuso

Tipologia: Pdf editoriale (Version of record)
Licenza: Tutti i diritti riservati
Dimensione 422.8 kB
Formato Adobe PDF
422.8 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1209247
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 2
social impact