Markov Chains, Random Walks, and Card Shuffling

ECU Author/Contributor (non-ECU co-authors, if there are any, appear on document)
Nolan Outlaw (Creator)
Institution
East Carolina University (ECU )
Web Site: http://www.ecu.edu/lib/

Abstract: 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.

Additional Information

Publication
Thesis
Language: English
Date: 2023
Subjects
Mathematics;Markov chains

Email this document to

This item references:

TitleLocation & LinkType of Relationship
Markov Chains, Random Walks, and Card Shufflinghttp://hdl.handle.net/10342/4953The described resource references, cites, or otherwise points to the related resource.