非交叉生成树上翻转链的快速混合

Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
{"title":"非交叉生成树上翻转链的快速混合","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":"{\"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}","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

摘要

我们证明,在凸位置上的 $n+1$ 点的非交叉生成树的翻转链混合时间为 $O(n^8\log n)$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rapid mixing of the flip chain over non-crossing spanning trees
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)$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信