Advanced SearchSearch Tips
Randomizing Sequences of Finite Length
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Randomizing Sequences of Finite Length
Huh, Myung-Hoe; Lee, Yong-Goo;
  PDF(new window)
It is never an easy task to physically randomize the sequence of cards. For instance, US 1970 draft lottery resulted in a social turmoil since the outcome sequence of 366 birthday numbers showed a significant relationship with the input order (Wikipedia, "Draft Lottery 1969", Retrieved 2009/05/01). We are motivated by Laplace's 1825 book titled Philosophical Essay on Probabilities that says "Suppose that the numbers 1, 2, ..., 100 are placed, according to their natural ordering, in an urn, and suppose further that, after having shaken the urn, to shuffle the numbers, one draws one number. It is clear that if the shuffling has been properly done, each number will have the same chance of being drawn. But if we fear that there are small differences between them depending on the order in which the numbers were put into the urn, we can decrease these differences considerably by placing these numbers in a second urn in the order in which they are drawn from the first urn, and then shaking the second urn to shuffle the numbers. These differences, already imperceptible in the second urn, would be diminished more and more by using a third urn, a fourth urn, &c." (translated by Andrew 1. Dale, 1995, Springer. pp. 35-36). Laplace foresaw what would happen to us in 150 years later, and, even more, suggested the possible tool to handle the problem. But he did omit the detailed arguments for the solution. Thus we would like to write the supplement in modern terms for Laplace in this research note. We formulate the problem with a lottery box model, to which Markov chain theory can be applied. By applying Markov chains repeatedly, one expects the uniform distribution on k states as stationary distribution. Additionally, we show that the probability of even-number of successes in binomial distribution with trials and the success probability approaches to 0.5, as n increases to infinity. Our theory is illustrated to the cases of truncated geometric distribution and the US 1970 draft lottery.
Lottery box;physical randomization;Markov chain;binomial distribution;
 Cited by
화투 섞기의 과학,허명회;이용구;

응용통계연구, 2010. vol.23. 6, pp.1209-1216 crossref(new window)
라플라스 (1925). <확률에 대한 철학적 시론> (제 5판). 조재근 역. 지식을만드는지식.

Bayer, D. and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair, Annals of Applied Probability, 2, 294-313. crossref(new window)

Finkelstein, M.O. and Levin, B. (2001). Statistics for Lawyers (Second Edition). Springer, New York. 262-265.