Cyclic to Random Transposition Shuffles
Ross G. Pinsky

TL;DR
This paper analyzes two variants of cyclic to random transposition shuffles, deriving explicit limiting density functions for the distribution of card positions and numbers, revealing discontinuities and extremal behaviors.
Contribution
It provides explicit formulas for the limiting distributions of card positions and labels in two new cyclic to random transposition shuffles, including analysis of their discontinuities.
Findings
Derived explicit limiting density functions for the shuffles
Identified discontinuities at the point x=b in the density functions
Showed extremal density values are approached near the discontinuities
Abstract
Consider a permutation as a deck of cards numbered from 1 to and laid out in a row, where denotes the number of the card that is in the -th position from the left.\rm\ We define two cyclic to random transposition shuffles. The first one works as follows: for , on the -th step transpose the card that was \it originally\rm\ the -th from the left with a random card (possibly itself). The second shuffle works as follows: on the -th step, transpose the card that is \it currently\rm\ in the -th position from the left with a random card (possibly itself). For these shuffles, for each , we calculate explicitly the limiting rescaled density function of , for the probability that a card with a number around ends up in a position around , and for each , we calculate the limiting rescaled density…
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
TopicsBayesian Methods and Mixture Models · Stochastic processes and statistical mechanics · Genome Rearrangement Algorithms
