Semi-Lagrangian Approximation of Master Equations with Individual Noise on Finite Graphs
Abstract
We develop and analyze a fully discrete semi-Lagrangian method for vector master equations associated with mean field games (MFGs) with individual noise on finite graphs. The method discretizes both the characteristic evolution in time and the population variable on the probability simplex. A central challenge is the degeneracy of the transport coefficients near the boundary of the open simplex, where no boundary condition is prescribed. To overcome this difficulty in the analysis, we introduce an interior localization based on exact density characteristics, which keeps numerical arrivals within compact regions of uniform coefficient control. Combined with a closure argument for the coupled numerical recursion, this localization yields local solvability of the updates and quantitative error bounds on compact subsets of the open simplex. Under additional C2-regularity of the exact solution and suitable space--time mesh coupling, these bounds imply first-order accuracy. Furthermore, the density and value trajectories generated by the numerical master feedback converge to the corresponding MFG characteristics at the same rate. In the potential setting, the associated reconstructed density--flux pair is admissible and asymptotically optimal for the planning problem, with an action gap quadratic in the feedback error. Numerical experiments illustrate the convergence rates, feedback responses to population redistribution, and the effects of graph topology.
Related
- Bounds-Constrained Finite Element Approximation of Time-Dependent Partial Differential Equations
- Diophantine Approximation by Lagrangian Frames in Symplectic Lattices
- Local well-posedness of general mean field game master equations
- A Formalism for Merging Power Series in Solving Multinomial Equations: Master Series and Master Numbers
- Parameter Estimation for Diffusive Stochastic Master Equations in Continuously Observed Quantum Systems
BibTeX
@misc{cui2026semilagrangian,
title = {{Semi-Lagrangian Approximation of Master Equations with Individual Noise on Finite Graphs}},
author = {Jianbo Cui and Tonghe Dang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17700},
eprint = {2610.17700},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17700},
}
RIS
TY - UNPB
TI - Semi-Lagrangian Approximation of Master Equations with Individual Noise on Finite Graphs
AU - Jianbo Cui
AU - Tonghe Dang
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2610.17700
UR - https://arxiv.org/abs/2610.17700
AB - We develop and analyze a fully discrete semi-Lagrangian method for vector master equations associated with mean field games (MFGs) with individual noise on finite graphs. The method discretizes both the characteristic evolution in time and the population variable on the probability simplex. A central challenge is the degeneracy of the transport coefficients near the boundary of the open simplex, where no boundary condition is prescribed. To overcome this difficulty in the analysis, we introduce an interior localization based on exact density characteristics, which keeps numerical arrivals within compact regions of uniform coefficient control. Combined with a closure argument for the coupled numerical recursion, this localization yields local solvability of the updates and quantitative error bounds on compact subsets of the open simplex. Under additional C^2-regularity of the exact solution and suitable space--time mesh coupling, these bounds imply first-order accuracy. Furthermore, the density and value trajectories generated by the numerical master feedback converge to the corresponding MFG characteristics at the same rate. In the potential setting, the associated reconstructed density--flux pair is admissible and asymptotically optimal for the planning problem, with an action gap quadratic in the feedback error. Numerical experiments illustrate the convergence rates, feedback responses to population redistribution, and the effects of graph topology.
ER -