A STUDY OF SHUFFLING CARDS AND STOPPING TIMES FOR RANDOMNESS
碩士 === 國立中山大學 === 應用數學系研究所 === 94 === In this paper we analyze how many shuffles are necessary to get close to ran- domness for a deck of n cards. Aldous (1983) shows that approximately 8.55 (n=52) shuffles are necessary when n is large. Bayer and Diaconis (1992) use the variation distance as a meas...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24725684386382856083 |