Saved in:
Bibliographic Details
Main Authors: Crucianelli, Carla, Tangpi, Ludovic
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2410.11240
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914973049946112
author Crucianelli, Carla
Tangpi, Ludovic
author_facet Crucianelli, Carla
Tangpi, Ludovic
contents We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the interacting particle system to a so called graphon stochastic differential equation. This is a system of uncountable many SDEs of McKean-Vlasov type driven by a continuum of Brownian motions. We make sense of this equation in a way that retains joint measurability and essentially pairwise independence of the driving Brownian motions of the system by using the framework of Fubini extension. The convergence results are general enough to cover nonlinear interactions, as well as various examples of sparse graphs. A crucial idea is to work with unbounded graphons and use the $L^p$ theory of sparse graph convergence.
format Preprint
id arxiv_https___arxiv_org_abs_2410_11240
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Interacting particle systems on sparse $W$-random graphs
Crucianelli, Carla
Tangpi, Ludovic
Probability
60H10 (Primary) 05C80 (Secondary)
We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the interacting particle system to a so called graphon stochastic differential equation. This is a system of uncountable many SDEs of McKean-Vlasov type driven by a continuum of Brownian motions. We make sense of this equation in a way that retains joint measurability and essentially pairwise independence of the driving Brownian motions of the system by using the framework of Fubini extension. The convergence results are general enough to cover nonlinear interactions, as well as various examples of sparse graphs. A crucial idea is to work with unbounded graphons and use the $L^p$ theory of sparse graph convergence.
title Interacting particle systems on sparse $W$-random graphs
topic Probability
60H10 (Primary) 05C80 (Secondary)
url https://arxiv.org/abs/2410.11240