Responsive image
博碩士論文 etd-0719106-131107 詳細資訊
Title page for etd-0719106-131107
論文名稱
Title
洗牌方式與隨機性之研究
A STUDY OF SHUFFLING CARDS AND STOPPING TIMES FOR RANDOMNESS
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
24
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2006-06-16
繳交日期
Date of Submission
2006-07-19
關鍵字
Keywords
隨機性、洗牌次數、適合度檢定、模擬
randomness, goodness of fit test, shuffle times, simulation
統計
Statistics
本論文已被瀏覽 5737 次,被下載 1962
The thesis/dissertation has been browsed 5737 times, has been downloaded 1962 times.
中文摘要
在這篇論文中我們研究n張牌要洗幾次才會均勻的問題.Aldous (1983) 證明當n很大時,大約要洗8.55次(n=52時).而Bayer和Diaconis (1992) 使用 variation distance的方法,說明當n為52張撲克牌時,洗7次就足夠了.然而前述的結論皆需用較深的數理統計理論去推導,這裡,我們提供一個簡單的方法去探討洗牌的隨機性,這個方法結合了適合度檢定與簡單的模擬步驟.模擬的結果說明了我們的結論與Bayer和Diaconis的結論是相似的.
Abstract
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 measure of randomness to analyze the most commonly used method of shuffling cards, and claim that 7 shuffles are enough when n=52. We provide another idea to measure the distance from randomness for repeated shuffles. The proposed method consists of a goodness of fit test and a simple simulation. Simulation results show that we have a similar conclusion to that of Bayer and Diaconis.
目次 Table of Contents
1 Introduction ...1
2 The riffle shuffle ...2
3 A measure of randomness: the variation distance ...5
4 A statistical method of measuring randomness ...7
4.1 A chi-square goodness of fit test ...7
4.2 Simulation procedure ...9
4.3 Example ...13
4.4 Simulation results ...14
5 Conclusion ...17
Reference ...18
參考文獻 References
[1] Aldous, D. and Diaconis, P. (1986). Shuffling cards and stopping times. American Mathematical Monthly 93 333-348.
[2] Bayer, D. and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair. Annals of Applied Probability 2(2) 294-313.
[3] Diaconis, P., Graham, R. L. and Kantor, W. M. (1983). The mathematics of perfact shuffles. Advances in Applied Mathematics 4 175-196.
[4] Gilbert, E. (1955). Theory of shuffling. Technical memorandum, Bell laboratories.
[5] Golomb, S. W. (1961). Permutations by cutting and shuffling. Society for Industrial and Applied Mathematics Review 3 293-297.
[6] Hogg, R. V. and Tanis, E. A. (2001). Probability and statistical inference, 6th ed. Prentice Hall, New Jersey.
[7] Mann, B. (1995). How many times should you shuffle a deck of cards? In Snell, J. L. (Ed.), Topics in contemporary probability and its applications, Probability and Stochastics Series, p. 261–289. CRC Press, Boca Raton, FL.
[8] Pearson, K. (1900). On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be
reasonably supposed to have arisen from random samplig. Philosophical Magazine 50(5) 157-175.
[9] Reeds, J. (1981). Unpublished manuscript. Cited in Aldous and Diaconis, 1986. Not consulted by the present author.
[10] Ross, S. M. (2002). Simulation, 3rd ed., Academic Press, San Diego.
[11] Tanny, S. (1973). A probability interpretation of the Eulerian numbers. Duke Mathematical Journal 40 717-722.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內立即公開,校外一年後公開 off campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code