Generating a random permutation with random transpositions

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  R. E. Ingram.  Some characters of the symmetric group , 1950 .

[3]  C. Curtis,et al.  Representation theory of finite groups and associated algebras , 1962 .

[4]  E. Hewitt,et al.  Abstract Harmonic Analysis , 1963 .

[5]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[6]  W. Feller,et al.  An Introduction to Probability Theory and Its Applications, Vol. 1 , 1967 .

[7]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[8]  J. Wrench.  Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[9]  R. Bhattacharya.  Speed of convergence of the n-fold convolution of a probability measure on a compact group , 1972 .

[10]  D. Griffeath.  A maximal coupling for Markov chains , 1975 .

[11]  Gordon James,et al.  The Representation Theory of the Symmetric Groups , 1977 .

[12]  Herbert Heyer,et al.  Probability Measures on Locally Compact Groups , 1977 .

[13]  Jean-Pierre Serre,et al.  Linear representations of finite groups , 1977, Graduate texts in mathematics.

[14]  I. G. MacDonald,et al.  Symmetric functions and Hall polynomials , 1979 .

[15]  Péter Major,et al.  A local limit theorem for the convolution of probability measures on a compact connected group , 1979 .

[16]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[17]  Ethan D. Bolker,et al.  The bias of three pseudo-random shuffles , 1981 .