Analysis of casino shelf shuffling machines
From MaRDI portal
Publication:363867
DOI10.1214/12-AAP884zbMath1283.60013arXiv1107.2961WikidataQ58803625 ScholiaQ58803625MaRDI QIDQ363867
Susan P. Holmes, Persi Diaconis, Jason Fulman
Publication date: 5 September 2013
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2961
Related Items
Enumerating two permutation classes by the number of cycles, On distribution of the number of peaks and the Euler numbers of permutations, Another conversation with Persi Diaconis, The mathematics of mixing things up, Card shuffling and \(P\)-partitions, On the joint distribution of descents and signs of permutations, The eigenvalues of hyperoctahedral descent operators and applications to card-shuffling, Central limit theorem for peaks of a random permutation in a fixed conjugacy class of \(S_n\), Sorting by shuffling methods and a queue, Counting permutations by peaks, descents, and cycle type, Plethystic formulas for permutation enumeration, Unimodal permutations and almost-increasing cycles, Hopf algebras and Markov chains: two examples and a theory, A real-world Markov chain arising in recreational volleyball
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A rule of thumb for riffle shuffling
- A symmetry of the descent algebra of a finite Coxeter group.
- Enriched \(P\)-partitions and peak algebras
- Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
- Carries, shuffling, and symmetric functions
- Trailing the dovetail shuffle to its lair
- No-feedback card guessing for dovetail shuffles
- The combinatorics of biased riffle shuffles
- Random walks and hyperplane arrangements
- Counting permutations with given cycle structure and descent set
- Signed permutation statistics and cycle type
- Cycle type and descent set in wreath products
- Peak quasisymmetric functions and Eulerian enumeration
- The peak algebra of the symmetric group
- Affine shuffles, shuffles with cuts, the Whitehouse module, and patience sorting
- Generalized riffle shuffles and quasisymmetric functions
- The cycle enumerator of unimodal permutations
- Foulkes characters, Eulerian idempotents, and an amazing matrix
- Riffle shuffles, cycles, and descents
- Applications of symmetric functions to cycle and increasing subsequence structure after shuffles
- Cycle structure of riffle shuffles
- Riffle shuffles and their associated dynamical systems
- Semisimple orbits of Lie algebras and card-shuffling measures on Coxeter groups
- A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
- Riffle shuffles of decks with repeated cards
- Cyclic descents and \(P\)-partitions.
- A Better Way to Deal the Cards
- Carries, Shuffling, and an Amazing Matrix
- Combinatorial Hopf algebras and generalized Dehn–Sommerville relations
- The Doctrine of Chances
- The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
- Shuffling Cards and Stopping Times
- Limit Measures Arising in the Asymptotic Theory of Symmetric Groups, II
- Generating a random permutation with random transpositions
- Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I.
- Information Loss in Riffle Shuffling
- The peak algebra and the descent algebras of types B and D
- Peaks and Eulerian numbers in a random sequence
- The cutoff phenomenon in finite Markov chains.
- Nonrandom Shuffling with Applications to the Game of Faro
- Ordered Cycle Lengths in a Random Permutation
- Enriched 𝑃-Partitions
- Magical Mathematics
- The cyclic structure of unimodal permutations
- Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems
