A Random Card Shuffling Process
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914966728081408 |
|---|---|
| author | Lewis, Joel Brewster Rai, Mehr |
| author_facet | Lewis, Joel Brewster Rai, Mehr |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_04614 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A Random Card Shuffling Process Lewis, Joel Brewster Rai, Mehr Probability Combinatorics 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. |
| title | A Random Card Shuffling Process |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2206.04614 |