Geometry of Graph Partitions via Optimal Transport
Geometry of Graph Partitions via Optimal Transport
We define a distance metric between partitions of a graph using machinery from optimal transport. Our metric is built from a linear assignment problem that matches partition components, with assignment cost proportional to transport distance over graph edges. We show that our distance can be computed using a single linear …