Papers
Topics
Authors
Recent
Search
2000 character limit reached

A curiously slowly mixing Markov chain

Published 3 Nov 2025 in math.PR, math.CO, and math.RT | (2511.01245v1)

Abstract: We study a Markov chain with very different mixing rates depending on how mixing is measured. The chain is the "Burnside process on the hypercube $C_2n$." Started at the all-zeros state, it mixes in a bounded number of steps, no matter how large $n$ is, in $\ell1$ and in $\ell2$. And started at general $x$, it mixes in at most $\log n$ steps in $\ell1$. But, in $\ell2$, it takes $\frac{n}{\log n}$ steps for most starting $x$. An interesting connection to Schur--Weyl duality between $\mathfrak{sl}_2(\mathbb{C})$ and $S_n$ further allows for analysis of the mixing time from arbitrary starting states.

Authors (3)

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.