Logo ipums

BIBLIOGRAPHY

Publications, working papers, and other research using data resources from IPUMS.

Full Citation

Title: Geometry of Graph Partitions via Optimal Transport

Citation Type: Miscellaneous

Publication Year: 2019

Abstract: 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 its value for new problems in ensemble-based analysis of political districting plans.

Url: https://arxiv.org/abs/1910.09618

User Submitted?: No

Authors: Abrishami, Tara; Guillen, Nestor; Rule, Parker; Schutzman, Zachary; Solomon, Justin; Weighill, Thomas; Wu, Si

Publisher: Cornell University

Data Collections: IPUMS NHGIS

Topics: Population Data Science

Countries:

IPUMS NHGIS NAPP IHIS ATUS Terrapop