Tools

LEADER 02484cam 2200505Ii 4500

001 ocn910850883;

003 OCoLC;

005 20151103143358.0;

006 m o d ;

007 cr bn|||||||||;

008 150608s2016 ncua ob 000 0 eng d;

035 a| (Sirsi) o910850883;

035 a| (OCoLC)910850883;

049 a| EREE;

090 a| QA274.7;

100 1 a| Outlaw, Nolan,e| author.?| UNAUTHORIZED;

245 10 a| Markov chains, random walks, and card shuffling /c| by Nolan Outlaw.;

264 1 a| [Greenville, N.C.] :b| [East Carolina University],c| 2016.;

300 a| 78 pages :b| illustrations;

336 a| textb| txt2| rdacontent;

337 a| computerb| c2| rdamedia;

338 a| online resourceb| cr2| rdacarrier;

347 a| text fileb| PDFc| 1.47Mb2| rda;

538 a| System requirements: Adobe Reader.;

538 a| Mode of access: World Wide Web.;

502 b| M.A.c| East Carolina Universityd| 2016.;

500 a| Presented to the faculty of the Department of Mathematics.;

500 a| Advisor: Gail Ratcliff.;

500 a| Title from PDF t.p. (viewed July 29, 2015).;

520 3 a| 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.;

504 a| Includes bibliographical references.;

650 0 a| Markov processes.=| ^A27090;

650 0 a| Random walks (Mathematics)=| ^A102861;

650 0 a| Card shuffling.=| ^A1272868;

653 a| Mathematics;

700 1 a| Ratcliff, Gail Dawn Loraine,e| degree supervisor.=| ^A1184208;

710 2 a| East Carolina University.b| Department of Mathematics.?| UNAUTHORIZED;

856 40 z| Access via ScholarShipu| http://hdl.handle.net/10342/4953;

949 o| jgml;

994 a| C0b| ERE;

596 a| 1 4;

998 a| 3766711;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 3766711-1001l| JNETm| JOYNERr| Ys| Yt| JNE3ETDu| 6/9/2015x| ETDz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 3766711-2001l| HSLELECm| HSLr| Ys| Yt| HEETDu| 6/9/2015x| ETDz| HERESOURCE;

Markov chains, random walks, and card shuffling / by Nolan Outlaw.

Author/creator	Outlaw, Nolan author.
Other author	Ratcliff, Gail Dawn Loraine, degree supervisor.
Other author	East Carolina University. Department of Mathematics.
Format	Theses and dissertations
Publication	[Greenville, N.C.] : [East Carolina University], 2016.
Description	78 pages : illustrations
Supplemental Content	Access via ScholarShip
Subjects	Markov processes. Random walks (Mathematics) Card shuffling.

Summary	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.
General note	Presented to the faculty of the Department of Mathematics.
General note	Advisor: Gail Ratcliff.
General note	Title from PDF t.p. (viewed July 29, 2015).
Dissertation note	M.A. East Carolina University 2016.
Bibliography note	Includes bibliographical references.
Technical details	System requirements: Adobe Reader.
Technical details	Mode of access: World Wide Web.

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

Markov chains, random walks, and card shuffling / by Nolan Outlaw.

Click here for more information about this title

Availability