Mixing on Generalized Associahedra
Combinatorics
2024-08-13 v1 Data Structures and Algorithms
Probability
Abstract
Eppstein and Frishberg recently proved that the mixing time for the simple random walk on the -skeleton of the associahedron is . We obtain similar rapid mixing results for the simple random walks on the -skeleta of the type- and type- associahedra. We adapt Eppstein and Frishberg's technique to obtain the same bound of in type and a bound of in type ; in the process, we establish an expansion bound that is tight up to logarithmic factors in type .
Keywords
Cite
@article{arxiv.2408.05611,
title = {Mixing on Generalized Associahedra},
author = {William Chang and Colin Defant and Daniel Frishberg},
journal= {arXiv preprint arXiv:2408.05611},
year = {2024}
}
Comments
19 pages, 6 figures