AI RESEARCH
Resistance Distance and Linearized Optimal Transport on Graphs
arXiv CS.LG
•
ArXi:2404.15261v4 Announce Type: replace-cross We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arko chains,'' J. Funct. Anal. 261(8), 2011) which nstrates various connections to the underlying combinatorial structure of the graph.