Return to search

Card-Shuffling Analysis with Weighted Rank Distance

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.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0624107-114731
Date24 June 2007
CreatorsWu, Kung-sheng
Contributorsnone, none, Chin-San Lee, Fu-Chuen Chang
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0624107-114731
Rightswithheld, Copyright information available at source archive

Page generated in 0.0024 seconds