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
Random walks and electric networks , volume 22
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Quadratic activity automaton groups are amenable, proved by resistance lower bounds in their Schreier graphs via a new weighted Nash-Williams criterion.
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
-
Amenability of quadratic automaton groups
Quadratic activity automaton groups are amenable, proved by resistance lower bounds in their Schreier graphs via a new weighted Nash-Williams criterion.