Homogenization of Hamilton-Jacobi equations on networks

Abstract

We prove a homogenization result for a family of time-dependent Hamilton-Jacobi equations, rescaled by a parameter tending to zero, posed on a periodic network, with a suitable notion of periodicity that will be defined. As becomes infinitesimal, we derive a limiting Hamilton-Jacobi equation in a Euclidean space, whose dimension is determined by the topological complexity of the network and is independent of the ambient space in which the network is embedded. Among the key contributions of our analysis, we extend to the setting of networks and graphs Mather's result on the asymptotic behavior of the average minimal action functional, as time tends to infinity. Additionally, we establish the well-posedness of the approximating problems, representing a nontrivial generalization of existing results for finite networks to a non-compact setting.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…