Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
{"title":"Rapid mixing of the flip chain over non-crossing spanning trees","authors":"Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang","doi":"arxiv-2409.07892","DOIUrl":null,"url":null,"abstract":"We show that the flip chain for non-crossing spanning trees of $n+1$ points\nin convex position mixes in time $O(n^8\\log n)$.","PeriodicalId":501245,"journal":{"name":"arXiv - MATH - Probability","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Probability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We show that the flip chain for non-crossing spanning trees of $n+1$ points
in convex position mixes in time $O(n^8\log n)$.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
