Markov Chains, Random Walks, and Card Shuffling
A common question in the study of random processes pertains to card shuffling. Whether or not a deck of cards is random can have huge implications on any game being played with those particular cards. This thesis explores the question of randomness by using techniques established through analysis of Markov chains, random walks, computer simulations, and some basic shuffling models. Ultimately, the aim is to explore the cutoff phenomenon, which asserts that at some point during the shuffling process there is a sharp decline in the shuffled deck's distance from random.
Outlaw, Nolan. (January 2016). Markov Chains, Random Walks, and Card Shuffling (Master's Thesis, East Carolina University). Retrieved from the Scholarship. (http://hdl.handle.net/10342/4953.)
Outlaw, Nolan. Markov Chains, Random Walks, and Card Shuffling. Master's Thesis. East Carolina University, January 2016. The Scholarship. http://hdl.handle.net/10342/4953. October 17, 2018.
Outlaw, Nolan, “Markov Chains, Random Walks, and Card Shuffling” (Master's Thesis., East Carolina University, January 2016).
Outlaw, Nolan. Markov Chains, Random Walks, and Card Shuffling [Master's Thesis]. Greenville, NC: East Carolina University; January 2016.
East Carolina University