Papers
Topics
Authors
Recent
Search
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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.