English

Total variation cutoff for the flip-transpose top with random shuffle

Probability 2021-05-03 v3

Abstract

We consider a random walk on the hyperoctahedral group BnB_n generated by the signed permutations of the forms (i,n)(i,n) and (i,n)(-i,n) for 1in1\leq i\leq n. We call this the flip-transpose top with random shuffle on BnB_n. We find the spectrum of the transition probability matrix for this shuffle. We prove that the mixing time for this shuffle is of order nlognn\log n. We also show that this shuffle exhibits the cutoff phenomenon. In the appendix, we show that a similar random walk on the demihyperoctahedral group DnD_n also has a cutoff at (n12)logn\left(n-\frac{1}{2}\right)\log n.

Keywords

Cite

@article{arxiv.1906.11544,
  title  = {Total variation cutoff for the flip-transpose top with random shuffle},
  author = {Subhajit Ghosh},
  journal= {arXiv preprint arXiv:1906.11544},
  year   = {2021}
}

Comments

21 pages, 2 figures, 1 table. Minor revisions. The main results are stated in the introduction. Remarks 2.5 and 4.2 are added. Theorem 2.1 is rephrased. Corrections are made in Section 3. The proof of the lower bound is simplified using probabilistic techniques, thanks to an anonymous referee of ALEA Lat. Am. J. Probab. Math. Stat. for the suggestion. Few minor changes are done in Theorem B.2

R2 v1 2026-06-23T10:05:11.721Z