A note on Fokker-Planck equations and graphons
Fabio Coppini

TL;DR
This paper explores the relationship between graphon-based interaction networks and particle system behavior, providing simplified solution representations and approximation methods for complex heterogeneous interactions.
Contribution
It introduces a simplified solution form for graphon particle systems and demonstrates how step-kernels can approximate these systems with explicit convergence rates.
Findings
Different graphons can produce identical particle behaviors.
Independence of initial conditions from the graphon leads to mean-field behavior.
Step-kernels effectively approximate graphon particle systems.
Abstract
Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the classical mean-field framework to account for heterogeneous interactions among particles. In many instances, such network heterogeneity is preserved in the limit which turns from being a single Fokker-Planck equation (also known as McKean-Vlasov) to an infinite system of non-linear partial differential equations (PDE) coupled by means of a graphon. While appealing from an applied viewpoint, few rigorous results exist on the graphon particle system. This note addresses such limit system focusing on the relation between interaction network and initial conditions: if the system initial datum and the graphon degrees satisfy a suitable condition, a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy · Advanced Thermodynamics and Statistical Mechanics · Theoretical and Computational Physics
