• Corpus ID: 245005984

Mixing times of one-sided $k$-transposition shuffles

  title={Mixing times of one-sided \$k\$-transposition shuffles},
  author={Evita Nestoridi and Kenny Peng},
Diagonalizing the transition matrix of a reversible Markov chain is extremely powerful when wanting to prove that the Markov chain exhibits the cutoff phenomenon. The first technique for diagonalizing the transition matrix of a random walk on the Caley graph of a finite group G was introduced by Diaconis and Shahshahani [2]. The technique, which relies on Schur’s lemma, requires understanding of the representation and character theory of G, and has been applied for many random walks on groups… 

Random Walks on the Generalized Symmetric Group: Cutoff for the One-sided Transposition Shuffle

. In this paper, we present a proof for the exhibition of a cutoff for the one-sided transposition (OST) shuffle on the generalized symmetric group G m,n . Our work shows that based on techniques for m



Cutoff for non-negatively curved Markov chains

Discovered by Aldous, Diaconis and Shahshahani in the context of card shuffling, the cutoff phenomenon has since then been established for a variety of Markov chains. However, proving cutoff remains

Cutoff for a one-sided transposition shuffle

We introduce a new type of card shuffle called one-sided transpositions. At each step a card is chosen uniformly from the pack and then transposed with another card chosen uniformly from below it.

Limit profiles for reversible Markov chains

In a recent breakthrough, Teyssier (Ann Probab 48(5):2323–2343, 2020) introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the

Cut-off phenomenon in the uniform plane Kac walk

We consider an analogue of the Kac random walk on the special orthogonal group $SO(N)$, in which at each step a random rotation is performed in a randomly chosen 2-plane of $\bR^N$. We obtain sharp

A lower bound for the mixing time of the random-to-random Insertions shuffle

This work shows that for large $n$ and $t_n$ as above, there exists $f(n)=\Theta(\sqrt{n\log n})$ such that, with high probability, under both the measure induced by the shuffle and the stationary measure, the number of cards within a certain distance from their initial position is f(n) plus a lower order term.

The random k cycle walk on the symmetric group

We study the random walk on the symmetric group $$S_n$$Sn generated by the conjugacy class of cycles of length k. We show that the convergence to uniform measure of this walk has a cut-off in total

Mixing times for random k-cycles and coalescence-fragmentation chains

Let $\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the

Random Rotations: Characters and Random Walks on SO(N)

We analyze a random walk on the orthogonal group SO(N) given by repeatedly rotating by a fixed angle through randomly chosen planes of R . We derive estimates of the rate at which this random walk

Generating Random Elements in SLn (Fq) by Random Transvections

AbstractThis paper studies a random walk based on random transvections in SLn(Fq) and shows that, given $$\in$$ > 0, there is a constant c such that after n + c steps the walk is within a distance

Random Shuffles and Group Representations

This paper considers random walks on a finite group G, in which the probability of going from x to yx, x,y ∈ G, depends only on y. The main results concern the distribution of the number of steps it