Optimal Transport for Network Comparison: A Review with Machine Learning Applications
This paper examines the closed form of the Wasserstein distance in one dimension via node feature probability distributions, and shows how the transport plans of the Wasserstein and Gromov-Wasserstein distances visualize how mass is shifted to transform one network into another.
James Hyun, F. G. Meyer
· 0 citations