First-Order Convergence of Monotone Schemes for Hamilton--Jacobi Equations on the Wasserstein Space on Graphs
This provides a rigorous convergence guarantee for numerical methods on Wasserstein spaces, which is important for optimal transport and related fields.
The paper proves first-order convergence of monotone finite difference schemes for Hamilton-Jacobi equations on the Wasserstein space over a finite graph, overcoming the boundary degeneracy that previously limited convergence rates to O(h^{1/2}).
We prove first-order convergence of semi-discrete monotone finite difference schemes for Hamilton--Jacobi equations on the Wasserstein space over a finite graph. A central challenge is the boundary degeneracy of the Wasserstein simplex, which prevents the direct use of the standard $L^1$ adjoint method and limits doubling-of-variables arguments to the suboptimal rate $\mathcal O(h^{\frac 12})$ \cite{CDM25}. We address this issue by introducing a weighted $L^1$ framework with a boundary-vanishing weight and by analyzing the corresponding weighted adjoint equation for the linearized operator of the scheme, featuring a new geometric drift term. Our proof relies on uniform bounds for the weighted adjoint variable and the mesh-parameter derivative of the numerical solution. These estimates are derived from discrete gradient and semi-concavity bounds, obtained through a bootstrap argument for two classes of monotone Hamiltonians.