Optimal Graphon Control of Collective Dynamics
Abstract
We study optimal control of non-linear graphon dynamics in which the interaction kernel itself is the control. Motivated by opinion formation in social networks, we ask how changing who influences whom can steer a population toward a desired outcome. We develop a framework using interaction kernels with bounded variation in the receiver label, providing compactness while accommodating finite networks. We prove existence of an optimal pair and show that finite-agent approximations recover the continuum optimal value under successive refinement of the network and initial data, with subsequential convergence of suitably chosen discrete optimizers. Numerical experiments use neural networks to approximate optimal controls for bounded-confidence and graphon Kuramoto dynamics, illustrating how changes in interactions can prevent fragmentation and promote synchronization.
Related
- General Leader-Follower Linear-Quadratic Stochastic Graphon Games with Indefinite Control Weights
- Optimal Control Under Signal Temporal Logic Constraints: A Robust Reformulation via Augmented Dynamics
- From forward-backward sweep to backpropagation for optimal control in tumor-immune dynamics.
- Complex dynamics of a fractional-order epidemic system integrating with fractional-order optimal control and PRCC analysis
- Modeling, Analysis, and Optimal Control of Leukemic Cell Population Dynamics Under Therapy
BibTeX
@misc{miller2026optimal,
title = {{Optimal Graphon Control of Collective Dynamics}},
author = {Joseph K. Miller and Brandon Su},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.31975},
eprint = {2610.31975},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.31975},
}
RIS
TY - UNPB
TI - Optimal Graphon Control of Collective Dynamics
AU - Joseph K. Miller
AU - Brandon Su
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.31975
UR - https://arxiv.org/abs/2610.31975
AB - We study optimal control of non-linear graphon dynamics in which the interaction kernel itself is the control. Motivated by opinion formation in social networks, we ask how changing who influences whom can steer a population toward a desired outcome. We develop a framework using interaction kernels with bounded variation in the receiver label, providing compactness while accommodating finite networks. We prove existence of an optimal pair and show that finite-agent approximations recover the continuum optimal value under successive refinement of the network and initial data, with subsequential convergence of suitably chosen discrete optimizers. Numerical experiments use neural networks to approximate optimal controls for bounded-confidence and graphon Kuramoto dynamics, illustrating how changes in interactions can prevent fragmentation and promote synchronization.
ER -