Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hamilton-Jacobi-Bellman equations on graphs

Published 10 Nov 2025 in math.AP | (2511.07653v1)

Abstract: Here, we study Hamilton-Jacobi-Bellman equations on graphs. These are meant to be the analog of any of the following types of equations in the continuum setting of partial differential and nonlocal integro-differential equations: Hamilton-Jacobi (typically first order and local), Hamilton-Jacobi-Bellmann-Isaacs (first, second, or fractional order), and elliptic integro-differential equations (nonlocal equations). We give conditions for the existence and uniqueness of solutions of these equations, and work through a long list of examples in which these assumptions are satisfied. This work is meant to accomplish three goals: complement and unite earlier assumptions and arguments focused more on the Hamilton-Jacobi type structure; import ideas from nonlocal elliptic integro-differential equations; and argue that nearly all of the operators in this family enjoy a common structure of being a monotone function of the differences of the unknown, plus ``lower order'' terms. This last goal is tied to the fact that most of the examples in this family can be proven to have a Bellman-Isaacs representation as a min-max of linear operators with a graph Laplacian structure.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.