First-Order Convergence of Monotone Schemes for Hamilton--Jacobi Equations on the Wasserstein Space on Graphs
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 L1 adjoint method and limits doubling-of-variables arguments to the suboptimal rate O(h 12) CDM25. We address this issue by introducing a weighted L1 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.