{"id":"https://openalex.org/W7203713055","doi":"https://doi.org/10.48550/arxiv.2608.14839","title":"Optimal Transport on Graphs and Stochastically Evolving Trees","display_name":"Optimal Transport on Graphs and Stochastically Evolving Trees","publication_year":2026,"publication_date":"2026-08-14","ids":{"openalex":"https://openalex.org/W7203713055","doi":"https://doi.org/10.48550/arxiv.2608.14839"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.14839","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.14839","pdf_url":"https://arxiv.org/pdf/2608.14839","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.14839","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006105305","display_name":"Fan Chung","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chung, Fan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5008994481","display_name":"Sawyer Jack Robertson","orcid":"https://orcid.org/0000-0002-4746-3075","observed_orcids":["https://orcid.org/0000-0002-4746-3075"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robertson, Sawyer Jack","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":true,"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.9994999766349792,"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.0,"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":[{"id":"https://openalex.org/keywords/optimal-transport","display_name":"optimal transport","score":0.9100000262260437},{"id":"https://openalex.org/keywords/wasserstein-1-distance","display_name":"1-Wasserstein distance","score":0.8339999914169312},{"id":"https://openalex.org/keywords/graphs","display_name":"graphs","score":0.8569999933242798},{"id":"https://openalex.org/keywords/spanning-trees","display_name":"spanning trees","score":0.9079999923706055},{"id":"https://openalex.org/keywords/glauber-dynamics","display_name":"Glauber dynamics","score":0.7400000095367432},{"id":"https://openalex.org/keywords/transportation-polytopes","display_name":"transportation polytopes","score":0.7829999923706055},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"gradient descent","score":0.8140000104904175},{"id":"https://openalex.org/keywords/global-minimum","display_name":"global minimum","score":0.5400000214576721},{"id":"https://openalex.org/keywords/ollivier-ricci-curvature","display_name":"Ollivier-Ricci curvature","score":0.9620000123977661},{"id":"https://openalex.org/keywords/discrete-probability-measures","display_name":"discrete probability measures","score":0.5249999761581421}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6855999827384949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6421999931335449},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5600000023841858},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5123000144958496},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5031999945640564},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.4514000117778778},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4198000133037567},{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3727000057697296},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.35690000653266907},{"id":"https://openalex.org/C138673069","wikidata":"https://www.wikidata.org/wiki/Q322229","display_name":"Tracing","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.33390000462532043},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.33309999108314514},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.3255999982357025},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.30809998512268066},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.2962000072002411},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.29580000042915344},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.28619998693466187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28349998593330383},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.274399995803833},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2720000147819519},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.2655999958515167},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.26019999384880066}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.14839","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.14839","pdf_url":"https://arxiv.org/pdf/2608.14839","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.14839","doi":"https://doi.org/10.48550/arxiv.2608.14839","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.14839","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.14839","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.14839","pdf_url":"https://arxiv.org/pdf/2608.14839","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7203713055.pdf","grobid_xml":"https://content.openalex.org/works/W7203713055.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W4395443879"],"related_works":["https://openalex.org/W2311954821","https://openalex.org/W7119506602","https://openalex.org/W3088790161","https://openalex.org/W4252321690","https://openalex.org/W1168826912","https://openalex.org/W2738952301","https://openalex.org/W7124226819","https://openalex.org/W7099524420","https://openalex.org/W7124766429","https://openalex.org/W6960014825"],"abstract_inverted_index":{"We":[0,91],"give":[1,149],"an":[2,26,146,150],"effective":[3],"algorithm":[4,113,152],"for":[5,114,129,153],"determining":[6],"the":[7,18,32,44,47,53,60,74,82,86,98,116,120,133,155],"transportation":[8,70,83,99,117],"distance":[9],"between":[10],"two":[11],"given":[12],"probability":[13,121],"density":[14,122],"functions":[15,123],"defined":[16],"on":[17,38,63],"vertices":[19,30,87],"of":[20,31,46,52,68,88,97,158],"a":[21,50,94,103,110,159],"graph":[22,57],"$G=(V,E)$":[23],"by":[24,80],"analyzing":[25],"associated":[27,58],"polytope.":[28,90],"The":[29,65],"polytope":[33,48],"correspond":[34],"to":[35,109],"feasible":[36],"flows":[37],"spanning":[39,54],"trees":[40],"in":[41,127,140],"$G$,":[42],"and":[43,106],"$1$-skeleton":[45],"is":[49,101],"projection":[51],"tree":[55],"state":[56],"with":[59],"Glauber":[61],"dynamics":[62],"$G$.":[64],"optimal":[66,134],"value":[67],"this":[69,89,107],"problem,":[71],"known":[72],"as":[73],"$1$-Wasserstein":[75],"distance,":[76],"can":[77,137],"be":[78,138],"computed":[79],"tracing":[81],"cost":[84,100,136],"along":[85],"show":[92],"that":[93],"local":[95],"minimum":[96],"also":[102],"global":[104],"minimum,":[105],"leads":[108],"steepest":[111],"descent":[112],"solving":[115],"problem.":[118],"If":[119],"take":[124],"discrete":[125],"values":[126],"$\u03b4\\mathbb{Z}$":[128],"some":[130],"$\u03b4>0$,":[131],"then":[132],"transport":[135],"reached":[139],"at":[141],"most":[142],"$\\frac{|V|-1}\u03b4$":[143],"steps.":[144],"As":[145],"application,":[147],"we":[148],"efficient":[151],"computing":[154],"Ollivier--Ricci":[156],"curvature":[157],"graph.":[160]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-08-19T00:00:00"}