A Random Card Shuffling Process

Autor: Lewis, Joel Brewster, Rai, Mehr
Rok vydání: 2022
Předmět:
Zdroj: Involve 17 (2024) 603-632
Druh dokumentu: Working Paper
DOI: 10.2140/involve.2024.17.603
Popis: Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move: If the top card and the bottom card of the deck differ in color place the top card at the bottom of the deck, otherwise, insert the top card randomly in the deck. We use tools from combinatorics, probability, and linear algebra to model this process as a finite Markov chain.
Comment: 26 pages, 1 figure
Databáze: arXiv