Mixing cards and convergence of Markov chains
| Autor: | Drašnar, Jan |
|---|---|
| Přispěvatelé: | Prokešová, Michaela, Beneš, Viktor |
| Jazyk: | čeština |
| Rok vydání: | 2012 |
| Předmět: | |
| Popis: | This thesis presents mixing of a deck of cards as a random walk on the group of permutations. Perfectly shuffled deck of cards is defined as uniform distribution on this group. For analysis of the distance between the uniform distribution and the current distribution of the Markov chain generated by the shuffling quite general methods are used that can be applied to many other problems - i.e. strong stacionary time, coupling and transformation to an inverse distribution. In the last chapter the riffle shuffle is studied and a rather well-known fact is proved that seven or eight shuffles should be enough to shuffle a deck of 52 cards. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|