Master equations with an individual noise on finite state graphs
Abstract
We develop a classical well-posedness and regularity theory on a finite connected weighted graph for an extended mean field game system, its associated master equation, and a Hamilton-Jacobi- Bellman equation on the probability simplex, all in the presence of an individual noise operator. The geometric structure is inherited from the logarithmic-mean activation functional of discrete optimal transport, under which the entropic Fokker-Planck equation appears as a gradient flow on the graph and the individual noise operator is a bilinear form in the probability vector and the Wasserstein gradient. A central technical step is a quantitative preservation-of-positivity estimate for the discrete continuity equation, which rules out finite-time boundary degeneracy and yields a classical solution theory for the master equation on the open simplex without imposing any boundary condition. As an application, we recover a Nash equilibrium interpretation of the discrete system in terms of Markov chains on the graph. Our setup is inspired by the computational algorithms for optimal mass transport of [10, 11] and provides a rigorous well-posedness theory for several of the equations derived in [25].
Keywords
Cite
@article{arxiv.2605.06589,
title = {Master equations with an individual noise on finite state graphs},
author = {Wilfrid Gangbo and Sebastian Munoz and Jeremy Wu and Zhaoyu Zhang},
journal= {arXiv preprint arXiv:2605.06589},
year = {2026}
}