Proves that the squared discrete transportation distance between nearby measures on a connected graph is bounded by the quadratic form of a reweighted Laplacian pseudoinverse, yielding a resistance distance with multiple characterizations and showing the random walk as gradient flow on the resulting
Automated identification of stratifying signatures in cellular subpopulations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Resistance Distance and Linearized Optimal Transport on Graphs
Proves that the squared discrete transportation distance between nearby measures on a connected graph is bounded by the quadratic form of a reweighted Laplacian pseudoinverse, yielding a resistance distance with multiple characterizations and showing the random walk as gradient flow on the resulting