Geometry of Graph Partitions via Optimal Transport

Abstract

© 2020 Tara Abrishami, Nestor Guillen, Parker Rule, 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 program without precomputing pairwise assignment costs and derive several theoretical properties of the metric. Finally, we provide experiments demonstrating these properties empirically, specifically focusing on the metric's value for new problems in ensemble-based analysis of political districting plans.