{"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/got-an-optimal-transport-framework-for-graph","title":"GOT: An Optimal Transport framework for Graph comparison","arxiv_id":"1906.02085","date":"2019-06-05","proceeding":"NeurIPS 2019 12","authors":["Hermina Petric Maretic","Mireille El Gheche","Giovanni Chierchia","Pascal Frossard"],"abstract":"We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows us to derive an explicit expression of the Wasserstein distance between graph signal distributions in terms of the graph Laplacian matrices. This leads to a structurally meaningful measure for comparing graphs, which is able to take into account the global structure of graphs, while most other measures merely observe local changes independently. Our measure is then used for formulating a new graph alignment problem, whose objective is to estimate the permutation that minimizes the distance between two graphs. We further propose an efficient stochastic algorithm based on Bayesian exploration to accommodate for the non-convexity of the graph alignment problem. We finally demonstrate the performance of our novel framework on different tasks like graph alignment, graph classification and graph signal prediction, and we show that our method leads to significant improvement with respect to the-state-of-art algorithms.","url_abs":"https://arxiv.org/abs/1906.02085v2","url_pdf":"https://arxiv.org/pdf/1906.02085v2.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":"abstracts"},"code_links":[{"paper_slug":"got-an-optimal-transport-framework-for-graph","repo_url":"https://github.com/Hermina/GOT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"got-an-optimal-transport-framework-for-graph","repo_url":"https://github.com/constantinosskitsas/Framework_GraphAlignment","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1906.02085","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02085"}},"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/Hermina/GOT","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/constantinosskitsas/Framework_GraphAlignment","reach":null}],"summary":{"ran_draft_wrong":1,"ran_fixture":1,"ran_honours":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"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":3,"samples":[{"code_sha256_prefix":"55c0686154ed6a96","entry":"create_permutation","repo":"Hermina/GOT","repo_kind":"official","path":"stochastic.py","file_url":"https://github.com/Hermina/GOT/blob/HEAD/stochastic.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"55c0686154ed6a96"}},{"code_sha256_prefix":"77746d38df6056f7","entry":"create_test_graphs","repo":"Hermina/GOT","repo_kind":"official","path":"stochastic.py","file_url":"https://github.com/Hermina/GOT/blob/HEAD/stochastic.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"77746d38df6056f7"}},{"code_sha256_prefix":"7ff87d8b10838942","entry":"graph_from_laplacian","repo":"Hermina/GOT","repo_kind":"official","path":"stochastic.py","file_url":"https://github.com/Hermina/GOT/blob/HEAD/stochastic.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7ff87d8b10838942"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}