arXiv:2408.05611 [math.CO]AbstractReferencesReviewsResources
Mixing on Generalized Associahedra
William Chang, Colin Defant, Daniel Frishberg
Published 2024-08-10Version 1
Eppstein and Frishberg recently proved that the mixing time for the simple random walk on the $1$-skeleton of the associahedron is $O(n^3\log^3 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(n^3\log^3 n)$ in type $B$ and a bound of $O(n^{13} \log^2 n)$ in type $D$; in the process, we establish an expansion bound that is tight up to logarithmic factors in type $B$.
Comments: 19 pages, 6 figures
Related articles: Most relevant | Search more
arXiv:math/0609303 [math.CO] (Published 2006-09-11)
The simple random walk and max-degree walk on a directed graph
arXiv:math/0401237 [math.CO] (Published 2004-01-19)
Enumerative properties of generalized associahedra
arXiv:math/0209143 [math.CO] (Published 2002-09-12)
Asymptotics of the transition probabilities of the simple random walk on self-similar graphs