Graph limit for interacting particle systems on weighted random graphs.
Saved in:
| Title: | Graph limit for interacting particle systems on weighted random graphs. |
|---|---|
| Authors: | Ayi, Nathalie1 (AUTHOR) nathalie.ayi@sorbonne-universite.fr, Pouradier Duteil, Nastassia2 (AUTHOR) nastassia.pouradier_duteil@sorbonne-universite.fr |
| Source: | Mathematical Models & Methods in Applied Sciences. May2026, Vol. 36 Issue 5, p1129-1174. 46p. |
| Subjects: | Weighted graphs, Limit theorems, Stochastic processes, Mathematical analysis, Graph theory, Numerical analysis |
| Abstract: | In this paper, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of graphons. We prove quantitative convergence results in probability, as the number of particles tends to infinity, of the finite-dimensional system toward the solution of a deterministic graph limit equation. In this limit equation, the graphon prescribing the interaction is given by the first moment of the weighted random graph law. We also study interacting particle systems posed on switching weighted random graphs, which are obtained by resetting the weighted random graph at regular time intervals. We reveal the interplay between the large-population limit and the switching time. In particular, we show that for a fixed switching time, these systems converge as the number of particles tends to infinity to the same graph limit equation, in which the interaction is prescribed by the constant-in-time first moment of the weighted random graph law. Our results are illustrated by some numerical simulations. [ABSTRACT FROM AUTHOR] |
| Copyright of Mathematical Models & Methods in Applied Sciences is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
