English

First-Order Convergence of Monotone Schemes for Hamilton--Jacobi Equations on the Wasserstein Space on Graphs

Numerical Analysis 2026-05-22 v1 Numerical Analysis

Abstract

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 L1L^1 adjoint method and limits doubling-of-variables arguments to the suboptimal rate O(h12)\mathcal O(h^{\frac 12}) \cite{CDM25}. We address this issue by introducing a weighted L1L^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.

Keywords

Cite

@article{arxiv.2605.22016,
  title  = {First-Order Convergence of Monotone Schemes for Hamilton--Jacobi Equations on the Wasserstein Space on Graphs},
  author = {Jianbo Cui and Tonghe Dang},
  journal= {arXiv preprint arXiv:2605.22016},
  year   = {2026}
}

Comments

34 pages