In this paper, we cite two weighted rank distances (Wilcoxon rank and Log rank) to analyze how many times must a deck of 52 cards be shuffled to become
sufficiently randomized. Bayer and Diaconis (1992) used the variation distance as a measure of randomness to analyze the card-shuffling. Lin (2006) used the deviation distance to analyze card-shuffling without complicated mathematics formulas. We provide two new ideas to measure the distance for card-shuffling analysis.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0624107-114731 |
| Date | 24 June 2007 |
| Creators | Wu, Kung-sheng |
| Contributors | none, none, Chin-San Lee, Fu-Chuen Chang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624107-114731 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0052 seconds