2000 character limit reached
Mixing on Generalized Associahedra
Published 10 Aug 2024 in math.CO, cs.DS, and math.PR | (2408.05611v1)
Abstract: Eppstein and Frishberg recently proved that the mixing time for the simple random walk on the $1$-skeleton of the associahedron is $O(n3\log3 n)$. We obtain similar rapid mixing results for the simple random walks on the $1$-skeleta of the type-$B$ and type-$D$ associahedra. We adapt Eppstein and Frishberg's technique to obtain the same bound of $O(n3\log3 n)$ in type $B$ and a bound of $O(n{13} \log2 n)$ in type $D$; in the process, we establish an expansion bound that is tight up to logarithmic factors in type $B$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.