{"id":"https://openalex.org/W7166898672","doi":"https://doi.org/10.4230/lipics.icalp.2026.12","title":"Faster Triangulation Mixing via Transport Flows","display_name":"Faster Triangulation Mixing via Transport Flows","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166898672","doi":"https://doi.org/10.4230/lipics.icalp.2026.12"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.12","is_oa":true,"landing_page_url":"http://www.jstor.org/stable/4140446","pdf_url":"https://lucatrevisan.github.io/books/expanders.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lucatrevisan.github.io/books/expanders.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071770469","display_name":"Vedat Levi Alev","orcid":"https://orcid.org/0009-0008-0340-6029"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Alev, Vedat Levi","raw_affiliation_strings":["University of Haifa, Israel"],"raw_orcid":"https://orcid.org/0009-0008-0340-6029","affiliations":[{"raw_affiliation_string":"University of Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066110850","display_name":"Daniel Frishberg","orcid":"https://orcid.org/0000-0002-1861-5439"},"institutions":[{"id":"https://openalex.org/I149919469","display_name":"California Polytechnic State University","ror":"https://ror.org/001gpfp45","country_code":"US","type":"education","lineage":["https://openalex.org/I149919469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Frishberg, Daniel","raw_affiliation_strings":["California Polytechnic State University, San Luis Obispo, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-1861-5439","affiliations":[{"raw_affiliation_string":"California Polytechnic State University, San Luis Obispo, CA, USA","institution_ids":["https://openalex.org/I149919469"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139764409","display_name":"Michail Sarantis","orcid":"https://orcid.org/0000-0002-6064-2019"},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Sarantis, Michail","raw_affiliation_strings":["Skyserv Handling Services, Athens, Greece"],"raw_orcid":"https://orcid.org/0000-0002-6064-2019","affiliations":[{"raw_affiliation_string":"Skyserv Handling Services, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047220138","display_name":"Prasad Tetali","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tetali, Prasad","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-1882-6487","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.7989000082015991},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6801999807357788},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6355999708175659},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.6316999793052673},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5109000205993652},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5023000240325928},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.39879998564720154}],"concepts":[{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.7989000082015991},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6801999807357788},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6355999708175659},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.6316999793052673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5935999751091003},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5109000205993652},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5023000240325928},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.4207000136375427},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.39879998564720154},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3662000000476837},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34540000557899475},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C2776085556","wikidata":"https://www.wikidata.org/wiki/Q183361","display_name":"Chen","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3098999857902527},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2973000109195709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2897000014781952},{"id":"https://openalex.org/C97074811","wikidata":"https://www.wikidata.org/wiki/Q6771322","display_name":"Markov chain mixing time","level":5,"score":0.2865999937057495},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2784000039100647},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2736000120639801},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.2671000063419342},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2639000117778778},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.25870001316070557},{"id":"https://openalex.org/C110202963","wikidata":"https://www.wikidata.org/wiki/Q1783542","display_name":"Convex geometry","level":5,"score":0.25040000677108765}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.4230/lipics.icalp.2026.12","is_oa":true,"landing_page_url":"http://www.jstor.org/stable/4140446","pdf_url":"https://lucatrevisan.github.io/books/expanders.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ConferencePaper"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26401","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.12","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.12/LIPIcs.ICALP.2026.12.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.12","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.12","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.12","is_oa":true,"landing_page_url":"http://www.jstor.org/stable/4140446","pdf_url":"https://lucatrevisan.github.io/books/expanders.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166898672.pdf","grobid_xml":"https://content.openalex.org/works/W7166898672.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,97,152],"prove":[1],"an":[2],"\u00d5(n\u00b2)":[3],"bound":[4,61,81,90],"for":[5,38,93,149],"the":[6,10,17,36,39,57,63,94,100,110,117,161],"relaxation":[7,79,95],"time":[8,12,29,41,65,80],"and":[9,48,51,70,104],"log-Sobolev":[11,14],"(inverse":[13],"constant)":[15],"of":[16,30,35,42,91,102,112,124,141],"classical":[18],"triangulation":[19],"flip":[20],"chain":[21,44],"on":[22,62],"a":[23,27,137],"convex":[24],"(n+2)-gon,":[25],"implying":[26],"mixing":[28,40,64],"\u00d5(n\u00b2).":[31],"The":[32],"previous":[33],"state":[34],"art":[37],"this":[43,129],"due":[45,66],"to":[46,67,145],"Eppstein":[47],"Frishberg":[49],"[Eppstein":[50,103],"Frishberg,":[52,105],"2023]":[53,106],"was":[54],"\u00d5(n\u00b3),":[55],"while":[56],"best":[58],"known":[59],"lower":[60],"Molloy,":[68],"Reed":[69],"Steiger":[71],"[Molloy":[72],"et":[73,121,126],"al.,":[74,122],"1997]":[75],"is":[76],"\u03a9(n^{3/2}).":[77],"Our":[78],"makes":[82],"significant":[83],"progress":[84],"towards":[85],"Aldous'":[86],"[Aldous,":[87],"2003]":[88],"conjectured":[89],"\u0398(n^{3/2})":[92],"time.":[96],"improve":[98],"upon":[99],"analysis":[101],"by":[107],"further":[108],"developing":[109],"framework":[111],"transport":[113],"flows":[114],"introduced":[115],"in":[116,160],"work":[118],"[Xiaoyu":[119],"Chen":[120,125],"2025]":[123],"al.":[127],"In":[128],"light,":[130],"our":[131,154],"results":[132],"can":[133],"be":[134],"seen":[135],"as":[136],"more":[138],"efficient":[139],"way":[140],"using":[142],"combinatorial":[143],"decompositions":[144],"obtain":[146],"functional":[147],"inequalities":[148],"Markov":[150],"chains.":[151],"hope":[153],"ideas":[155],"will":[156],"find":[157],"other":[158],"applications":[159],"future.":[162]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-07-02T00:00:00"}