{"id":"https://openalex.org/W4416368448","doi":"https://doi.org/10.1109/lcsys.2025.3634944","title":"Optimal Multimarginal Schr\u00f6dinger Bridge: Minimum Spanning Tree Over Measure-Valued Vertices","display_name":"Optimal Multimarginal Schr\u00f6dinger Bridge: Minimum Spanning Tree Over Measure-Valued Vertices","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416368448","doi":"https://doi.org/10.1109/lcsys.2025.3634944"},"language":null,"primary_location":{"id":"doi:10.1109/lcsys.2025.3634944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2025.3634944","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093013953","display_name":"Georgiy A. Bondar","orcid":"https://orcid.org/0009-0008-1369-2495"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Georgiy A. Bondar","raw_affiliation_strings":["Department of Applied Mathematics, University of California at Santa Cruz, Santa Cruz, CA, USA","Department of Applied Mathematics, University of California, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of California at Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Department of Applied Mathematics, University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029714029","display_name":"Abhishek Halder","orcid":"https://orcid.org/0000-0002-1509-5853"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abhishek Halder","raw_affiliation_strings":["Department of Aerospace Engineering, Iowa State University, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5093013953"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27274215,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"2555","last_page":"2560"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.17110000550746918,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.17110000550746918,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.05480000004172325,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11513","display_name":"stochastic dynamics and bifurcation","score":0.03920000046491623,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7746999859809875},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7067999839782715},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.48750001192092896},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4794999957084656},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4763000011444092},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4424999952316284},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4334000051021576},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.3880000114440918},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.38580000400543213}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7746999859809875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7566999793052673},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7067999839782715},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6628000140190125},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.48750001192092896},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4794999957084656},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4763000011444092},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4424999952316284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44020000100135803},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4334000051021576},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.38580000400543213},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.34790000319480896},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3458999991416931},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.33379998803138733},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3244999945163727},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.31630000472068787},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.3111000061035156},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.28529998660087585},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcsys.2025.3634944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2025.3634944","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2425358650","display_name":null,"funder_award_id":"2111688","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1552092932","https://openalex.org/W1965525854","https://openalex.org/W1996064221","https://openalex.org/W2007610503","https://openalex.org/W2029565994","https://openalex.org/W2036996178","https://openalex.org/W2084224084","https://openalex.org/W2099111195","https://openalex.org/W2163166770","https://openalex.org/W2970685975","https://openalex.org/W2999010383","https://openalex.org/W3047849019","https://openalex.org/W3093980270","https://openalex.org/W3168875907","https://openalex.org/W3173544475","https://openalex.org/W3182348197","https://openalex.org/W4233121052","https://openalex.org/W4402265838","https://openalex.org/W4410114737"],"related_works":[],"abstract_inverted_index":{"The":[0,99,128],"Multimarginal":[1],"Schr\u00f6dinger":[2],"Bridge":[3],"(MSB)":[4],"finds":[5],"the":[6,24,49,53,57,61,73,79,90,114,118,123,126,144],"optimal":[7,54,62,74,115],"coupling":[8,63],"among":[9],"a":[10,19,32,103,111,132],"collection":[11],"of":[12,51,113,117,125],"random":[13],"vectors":[14],"with":[15,39,106],"known":[16,20],"statistics":[17],"and":[18,47,122],"correlation":[21,28],"structure.":[22],"In":[23,42],"MSB":[25,55,75],"formulation,":[26],"this":[27,43],"structure":[29],"is":[30],"specified":[31],"priori":[33],"as":[34],"an":[35],"undirected":[36],"connected":[37],"graph":[38,67,105],"measure-valued":[40,85],"vertices.":[41,86],"work,":[44],"we":[45,59],"formulate":[46],"solve":[48],"problem":[50,83,92,136],"finding":[52],"in":[56,96],"sense":[58],"seek":[60],"over":[64,84,137],"all":[65],"possible":[66],"structures.":[68],"We":[69,87],"find":[70],"that":[71,89,138],"computing":[72],"amounts":[76],"to":[77,110],"solving":[78],"minimum":[80,133],"spanning":[81,134],"tree":[82,135],"show":[88],"resulting":[91],"can":[93],"be":[94],"solved":[95],"two":[97],"steps.":[98],"first":[100],"step":[101,130],"constructs":[102],"complete":[104],"edge":[107],"weight":[108],"equal":[109],"sum":[112],"value":[116],"corresponding":[119],"bimarginal":[120],"SB":[121],"entropies":[124],"endpoints.":[127],"second":[129],"solves":[131],"weighted":[139],"graph.":[140],"Numerical":[141],"experiments":[142],"illustrate":[143],"proposed":[145],"solution.":[146]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-19T00:00:00"}