English

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 11-skeleton of the associahedron is O(n3log3n)O(n^3\log^3 n). We obtain similar rapid mixing results for the simple random walks on the 11-skeleta of the type-BB and type-DD associahedra. We adapt Eppstein and Frishberg's technique to obtain the same bound of O(n3log3n)O(n^3\log^3 n) in type BB and a bound of O(n13log2n)O(n^{13} \log^2 n) in type DD; in the process, we establish an expansion bound that is tight up to logarithmic factors in type BB.

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

R2 v1 2026-06-28T18:09:31.974Z