Cutoff phenomenon for the warp-transpose top with random shuffle
Subhajit Ghosh

TL;DR
This paper analyzes a specific random shuffle on the complete monomial group, determining its spectral properties and proving it exhibits cutoff phenomena in both and total variation distances with explicit mixing times.
Contribution
It introduces the warp-transpose top with random shuffle on $G_n \u2283 S_n$, finds its spectrum, and establishes cutoff phenomena with precise mixing times.
Findings
Spectral analysis of the transition matrix.
Mixing time is $O(n \u2261 n + rac{1}{2} n \u2261 (|G_n|-1))$.
Exhibits -cutoff at $n \u2261 n + rac{1}{2} n \u2261 (|G_n|-1)$ and total variation cutoff at $n \u2261 n.
Abstract
Let be a sequence of non-trivial finite groups. In this paper, we study the properties of a random walk on the complete monomial group generated by the elements of the form and for . We call this the warp-transpose top with random shuffle on . We find the spectrum of the transition probability matrix for this shuffle. We prove that the mixing time for this shuffle is . We show that this shuffle exhibits -cutoff at and total variation cutoff at .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Graph theory and applications · Random Matrices and Applications
