Rapid mixing of the flip chain over non-crossing spanning trees
<|reference_start|>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)$.<|reference_end|>
@article{anand2024rapid,
    title={Rapid mixing of the flip chain over non-crossing spanning trees},
    author={Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum,
  Jiaheng Wang},
    journal={arXiv preprint arXiv:2409.07892},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.07892},
    primaryClass={math.PR cs.CG cs.DM math.CO}
}