{"id":"https://openalex.org/W7225264661","doi":"https://doi.org/10.48550/arxiv.2611.05048","title":"Graph Similarity Meets Optimal Transport","display_name":"Graph Similarity Meets Optimal Transport","publication_year":2026,"publication_date":"2026-11-03","ids":{"openalex":"https://openalex.org/W7225264661","doi":"https://doi.org/10.48550/arxiv.2611.05048"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2611.05048","doi":"https://doi.org/10.48550/arxiv.2611.05048","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2611.05048","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2611.05048","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097277949","display_name":"Jens Breitung","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Breitung, Jens","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066080280","display_name":"Timo Gervens","orcid":"https://orcid.org/0000-0002-1224-9853","observed_orcids":["https://orcid.org/0000-0002-1224-9853"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gervens, Timo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142","observed_orcids":["https://orcid.org/0000-0002-0292-9142"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grohe, Martin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10229","display_name":"Geometric Analysis and Curvature Flows","score":0.7797999978065491,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10229","display_name":"Geometric Analysis and Curvature Flows","score":0.7797999978065491,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.1462000012397766,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0414000004529953,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.8001000285148621},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7497000098228455},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7232999801635742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.656000018119812},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6474999785423279},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6194999814033508},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.551800012588501},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4878999888896942},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.46129998564720154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43299999833106995},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4251999855041504},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.2791999876499176},{"id":"https://openalex.org/C2778114796","wikidata":"https://www.wikidata.org/wiki/Q7575194","display_name":"Spectral gap","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C48659774","wikidata":"https://www.wikidata.org/wiki/Q4907197","display_name":"Bijection, injection and surjection","level":3,"score":0.2621000111103058},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2611.05048","doi":"https://doi.org/10.48550/arxiv.2611.05048","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2611.05048","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2611.05048","doi":"https://doi.org/10.48550/arxiv.2611.05048","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2611.05048","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"natural":[1],"way":[2],"to":[3,8,17,57,73,133,141,180],"compare":[4],"two":[5],"graphs":[6,58,68,194],"is":[7,228,260],"align":[9],"their":[10,106,113],"vertex":[11,87],"sets":[12],"by":[13],"a":[14,27,201],"bijection":[15],"and":[16,47,135,175,191,213,223,234,242,262,273],"measure":[18],"the":[19,22,32,38,41,44,48,67,82,86,90,99,117,122,128,136,144,160,210,229,240,256,270],"difference":[20],"of":[21,59,66,92,220,266],"aligned":[23],"adjacency":[24],"matrices":[25],"in":[26,89],"matrix":[28],"norm.":[29],"Depending":[30],"on":[31,85,127],"norm,":[33],"this":[34],"yields,":[35],"for":[36,186,239,269],"example,":[37],"edit":[39,50,118,212,241,275],"distance,":[40,43,46,119,146,233],"cut":[42,145,243],"spectral":[45,214],"local":[49,211,274],"distance.":[51],"To":[52],"make":[53],"these":[54],"distances":[55,259],"applicable":[56],"different":[60],"order,":[61],"one":[62],"can":[63,103],"consider":[64],"blowups":[65],"or,":[69],"equivalently,":[70],"relax":[71],"bijections":[72],"fractional":[74],"alignments,":[75],"that":[76,109,151,205,254],"is,":[77,110],"optimal":[78,100,231,257],"transport":[79,101,232,258],"plans":[80],"between":[81],"uniform":[83],"distributions":[84],"sets,":[88],"spirit":[91],"Gromov-Wasserstein":[93],"distances.":[94,276],"We":[95,158],"investigate":[96],"how":[97],"much":[98],"versions":[102],"differ":[104],"from":[105,131,139,155],"bijective":[107],"counterparts,":[108],"we":[111,120,147,192,216,235,252,263],"quantify":[112],"integrality":[114,129],"gaps.":[115],"For":[116,143,209],"improve":[121,159],"best":[123,162],"known":[124,163],"upper":[125,164,218,247],"bound":[126,138,165,204],"gap":[130],"3":[132],"2":[134],"lower":[137,203],"6/5":[140],"4/3.":[142],"approach":[148],"Lov\u00e1sz's":[149,207],"conjecture":[150],"$\u03b4_\\square":[152,166,181],"\\le":[153,167,182],"2\u03b4_\\square^{OT}$":[154],"both":[156],"sides.":[157],"previously":[161],"32":[168],"\\cdot":[169,184],"(\u03b4_\\square^{OT})^{1/67}$":[170],"(Borgs,":[171],"Chayes,":[172],"Lov\u00e1sz,":[173],"S\u00f3s":[174],"Vesztergombi,":[176],"Adv.":[177],"Math.":[178],"2008)":[179],"C_\\varepsilon":[183],"(\u03b4_\\square^{OT})^{1-\\varepsilon}$":[185],"every":[187],"$\\varepsilon":[188],">":[189],"0$,":[190],"construct":[193],"$G,H$":[195],"with":[196],"$\u03b4_\\square(G,H)":[197],"=":[198],"2\u03b4_\\square^{OT}(G,H)$,":[199],"establishing":[200],"factor-2":[202],"matches":[206],"conjecture.":[208],"distances,":[215,244],"obtain":[217],"bounds":[219,248],"order":[221],"$\\sqrt{t\\ln(1/t)}$":[222],"$\\sqrt{t}$,":[224],"respectively,":[225],"where":[226],"$t$":[227],"corresponding":[230],"show":[236,253],"that,":[237],"unlike":[238],"no":[245],"linear":[246],"are":[249],"possible.":[250],"Finally,":[251],"computing":[255],"NP-hard,":[261],"give":[264],"hardness":[265],"approximation":[267],"results":[268],"cut,":[271],"spectral,":[272]},"counts_by_year":[],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2026-11-05T00:00:00"}