Reformulates Schrödinger problem on metric graphs via entropic OT with Γ-convergence to OT, derives dynamic version converging to Wasserstein distance and geodesics, and proves existence for general data.
Dynamic Optimal Transport on Networks , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Schr\"odinger problem on metric graphs
Reformulates Schrödinger problem on metric graphs via entropic OT with Γ-convergence to OT, derives dynamic version converging to Wasserstein distance and geodesics, and proves existence for general data.