Cutoff phenomenon for the warp-transpose top with random shuffle
Abstract
Let \Gn\1∞ be a sequence of non-trivial finite groups. In this paper, we study the properties of a random walk on the complete monomial group Gn Sn generated by the elements of the form (e,…,e,g;id) and (e,…,e,g-1,e,…,e,g;(i,n)) for g∈ Gn,\;1≤ i< n. We call this the warp-transpose top with random shuffle on Gn Sn. We find the spectrum of the transition probability matrix for this shuffle. We prove that the mixing time for this shuffle is O(n n+12n (|Gn|-1)). We show that this shuffle exhibits 2-cutoff at n n+12n (|Gn|-1) and total variation cutoff at n n.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.