Stochastic homogenization of dynamical discrete optimal transport
Abstract
The aim of this paper is to examine the large-scale behavior of dynamical optimal transport on stationary random graphs embedded in n. Our primary contribution is a stochastic homogenization result that characterizes the effective behavior of the discrete problems in terms of a continuous optimal transport problem, where the homogenized energy density results from the geometry of the discrete graph.
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.