A spanning-tree gauge and upwind discretization allow a well-posed Newton method for dynamical optimal transport on graphs while preserving density positivity on lattices.
Diestel.Graph Theory, volume 173 ofGraduate Texts in Mathematics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Newton's method for optimal transport problem on graphs
A spanning-tree gauge and upwind discretization allow a well-posed Newton method for dynamical optimal transport on graphs while preserving density positivity on lattices.