REVIEW 2 cited by
Kantorovich distance on a finite metric space
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Kantorovich distance (or 1-Wasserstein distance) on the probability simplex of a finite metric space is the value of a Linear Programming problem for which a closed-form expression is known in some cases. When the ground distance is defined by a graph, a few examples have already been studied. In the present paper, after re-deriving, with different tools, the result for trees, we prove that, for an arbitrary weighted graph, the K-distance is the minimum of the K-distances over all the spanning trees associated with the graph. We work in the dual LP-problem by using Arens-Eells norm associated with the metric space. Finally, we introduce new norms that are naturally related to $\ell_1$-embeddable distances and allows for a partial extension of our results to this new setting.
Forward citations
Cited by 2 Pith papers
-
Quantum Hamming Metrics
The quantum Hamming metric is derived from the classical Hamming metric by expressing the Lipschitz constant as a maximum of quotient-norm seminorms and then dropping commutativity.
-
Lin-Lu-Yau Ricci curvature on hypergraphs
The proposed hyperedge LLY curvature for hypergraphs has an ill-defined limit and the worked example is internally inconsistent.
Discussion (0). Continue with ORCID to comment.