The nonlinear heat equation on dense graphs and graph limits
Georgi S. Medvedev

TL;DR
This paper establishes a rigorous mathematical framework for deriving continuum limits of dynamical networks on convergent graph sequences, linking graph theory, nonlinear PDEs, and numerical methods, with applications to complex network dynamics.
Contribution
It provides the first rigorous proof of continuum limits for certain complex networks and connects these limits to classical numerical scheme convergence analysis.
Findings
Proves convergence of discrete network solutions to continuous equations.
Shows convergence rate depends on the fractal dimension of graphon boundaries.
Links continuum limits to classical numerical methods like Galerkin and Monte Carlo.
Abstract
We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend this method to cover many complex networks, for which it has not been applied before. Specifically, for dynamical networks on convergent sequences of simple and weighted graphs, we prove convergence of solutions of the initial-value problems for discrete models to those of the limiting continuous equations. In addition, for sequences of simple graphs converging to {0, 1}-valued graphons, it is shown that the convergence rate depends on the fractal dimension of the boundary of the support of the graph limit. These results are then used to study the regions of continuity of chimera states and the attractors of the nonlocal Kuramoto equation on certain…
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.
