{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/geometry-of-graph-partitions-via-optimal","title":"Geometry of Graph Partitions via Optimal Transport","arxiv_id":"1910.09618","date":"2019-10-21","proceeding":null,"authors":["Tara Abrishami","Nestor Guillen","Parker Rule","Zachary Schutzman","Justin Solomon","Thomas Weighill","Si Wu"],"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_abs":"http://arxiv.org/abs/1910.09618v1","url_pdf":"http://arxiv.org/pdf/1910.09618v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"geometry-of-graph-partitions-via-optimal","repo_url":"https://github.com/vrdi/geometry-of-graph-partitions","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=1910.09618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09618"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/vrdi/geometry-of-graph-partitions","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":10},"by_repo_kind":{"official":{"samples":10,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"eaa8002f74cfb89f","entry":"annealing_cut_accept2","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"experiments/Arkansas_annealing/annealonerun.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/experiments/Arkansas_annealing/annealonerun.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"eaa8002f74cfb89f"}},{"code_sha256_prefix":"3e0748ab68bed001","entry":"avg_pop_dist","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"Iowa/iowa.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/Iowa/iowa.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3e0748ab68bed001"}},{"code_sha256_prefix":"86651e251375e9c9","entry":"district_distance","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"experiments/Arkansas_annealing/wasserplan.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/experiments/Arkansas_annealing/wasserplan.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"86651e251375e9c9"}},{"code_sha256_prefix":"9b0b5d9c3e704ac0","entry":"getbeta","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"experiments/Arkansas_annealing/annealonerun.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/experiments/Arkansas_annealing/annealonerun.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9b0b5d9c3e704ac0"}},{"code_sha256_prefix":"bad802c804dc647f","entry":"landmarkMDS_2D","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"experiments/Arkansas_annealing/LMDS.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/experiments/Arkansas_annealing/LMDS.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bad802c804dc647f"}},{"code_sha256_prefix":"657691f7e4c2bfea","entry":"load_run","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"Iowa/save_data.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/Iowa/save_data.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"657691f7e4c2bfea"}},{"code_sha256_prefix":"f7598770eae99b5a","entry":"num_splits","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"Iowa/iowa.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/Iowa/iowa.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f7598770eae99b5a"}},{"code_sha256_prefix":"8c6edb1a8f399cb6","entry":"pop_dist_pct","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"Iowa/iowa.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/Iowa/iowa.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8c6edb1a8f399cb6"}},{"code_sha256_prefix":"71fdc307be9c30bf","entry":"remap","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"Iowa/save_data.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/Iowa/save_data.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"71fdc307be9c30bf"}},{"code_sha256_prefix":"d1fe0e2ebe85267b","entry":"step_num","repo":"vrdi/geometry-of-graph-partitions","repo_kind":"official","path":"experiments/Arkansas_annealing/annealonerun.py","file_url":"https://github.com/vrdi/geometry-of-graph-partitions/blob/HEAD/experiments/Arkansas_annealing/annealonerun.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d1fe0e2ebe85267b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}