English

Cutoff phenomenon for the warp-transpose top with random shuffle

Probability 2025-04-17 v4

Abstract

Let {Gn}1\{G_n\}_1^{\infty} be a sequence of non-trivial finite groups. In this paper, we study the properties of a random walk on the complete monomial group GnSnG_n\wr S_n generated by the elements of the form (e,,e,g;id)(\text{e},\dots,\text{e},g;\text{id}) and (e,,e,g1,e,,e,g;(i,n))(\text{e},\dots,\text{e},g^{-1},\text{e},\dots,\text{e},g;(i,n)) for gGn,  1i<ng\in G_n,\;1\leq i< n. We call this the warp-transpose top with random shuffle on GnSnG_n\wr S_n. We find the spectrum of the transition probability matrix for this shuffle. We prove that the mixing time for this shuffle is O(nlogn+12nlog(Gn1))O\left(n\log n+\frac{1}{2}n\log (|G_n|-1)\right). We show that this shuffle exhibits 2\ell^2-cutoff at nlogn+12nlog(Gn1)n\log n+\frac{1}{2}n\log (|G_n|-1) and total variation cutoff at nlognn\log n.

Keywords

Cite

@article{arxiv.2101.00533,
  title  = {Cutoff phenomenon for the warp-transpose top with random shuffle},
  author = {Subhajit Ghosh},
  journal= {arXiv preprint arXiv:2101.00533},
  year   = {2025}
}

Comments

This version of the article has been accepted for publication in the Journal of Algebraic Combinatorics: An International Journal; see the journal reference for the published version

R2 v1 2026-06-23T21:42:53.608Z