Polynomial mixing for polygonal side matchings
Probability
2026-07-02 v1 Combinatorics
Abstract
We introduce a natural Markov chain on chord diagrams, which, at every step, selects two random chords and swaps them if doing so preserves the diagram's genus. This generalizes the chord swap chain on the Catalan structure of non-intersecting chord diagrams. We show that for fixed genus, the chain mixes in polynomial time.
Cite
@article{arxiv.2607.02410,
title = {Polynomial mixing for polygonal side matchings},
author = {Renan Gross and Anđela Šarković},
journal= {arXiv preprint arXiv:2607.02410},
year = {2026}
}
Comments
23 pages, 19 figures. Comments welcome!