Geometry of Graph Partitions via Optimal Transport
© 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 g...
Main Authors: | Abrishami, Tara, Guillen, Nestor, Rule, Parker, Schutzman, Zachary, Solomon, Justin, Weighill, Thomas, Wu, Si |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Society for Industrial & Applied Mathematics (SIAM)
2021
|
Online Access: | https://hdl.handle.net/1721.1/135303 |
Similar Items
-
Empirical sampling of connected graph partitions for redistricting
by: Najt, Elle, et al.
Published: (2022) -
Quadratically Regularized Optimal Transport on Graphs
by: Essid, Montacer, et al.
Published: (2022) -
Quadratically Regularized Optimal Transport on Graphs
by: Essid, Montacer, et al.
Published: (2021) -
A Convex Optimization Framework for Regularized Geodesic Distances
by: Edelstein, Michal, et al.
Published: (2023) -
Solving graph compression via optimal transport
by: Garg, Vikas, et al.
Published: (2021)