A note on uniform in time meanfield limit in graphs
Abstract
In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the restoring force satisfies a general onesided Lipschitz condition (thus allowing for nonconvex confining potential) and the graph is dense enough, we use a coupling method suggested by Eberle known as reflection coupling to obtain uniform in time meanfield limit with bounds that depend explicitly on the graph structure.
 Publication:

arXiv eprints
 Pub Date:
 November 2022
 DOI:
 10.48550/arXiv.2211.11519
 arXiv:
 arXiv:2211.11519
 Bibcode:
 2022arXiv221111519L
 Keywords:

 Mathematics  Probability
 EPrint:
 V2 : Minor modifications and corrections, added appendix. 16 pages