Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Topic: Compare two methods of random permutations
Replies: 8   Last Post: Jul 28, 2015 12:29 PM

 Messages: [ Previous | Next ]
 Mok-Kong Shen Posts: 594 Registered: 12/8/04
Compare two methods of random permutations
Posted: May 8, 2013 5:29 AM

I want to compare in a practical sense two methods of random
permutations -- one theoretically perfect, namely that of Fisher and
Yates, and another ad hoc, let's call it X. A way of comparison I could
think of is the following:

One starts from the standard configuration of n objects [0, 1, 2,
...., n-1] and apply each method a fairly large number of times
successively to permute them and each time one computes the Hamming
distance of the result from the standard configuaration. One obtains
thus the frequency distribution of the Hamming distances for each
method. If the frequency distributions are fairly comparable to each
other, then X could be practically employed in place of the
theoretically perfect one.

Is this line of thought of mine correct? Does anyone have an idea of
a better method of comparison? Thanks in advance.

M. K. Shen

Date Subject Author
5/8/13 Mok-Kong Shen
5/10/13 Ray Koopman
5/10/13 Richard Ulrich
5/10/13 Mok-Kong Shen
5/10/13 Gordon Sande
5/11/13 Mok-Kong Shen
5/12/13 David Jones
5/13/13 Mok-Kong Shen
7/28/15 sean.c4s.vn@gmail.com