Information loss in top to random shuffling

Combinatorics Probability and Computing

Volumn 11, Issue 6, 2002, Pages 607-627

  Stark, Dudley ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY DENSITY FUNCTION; THEOREM PROVING;

GILBERT-SHANNON-REEDS MODEL; INFORMATION LOSS; PERMUTATION; POISSON APPROXIMATION; RELATIVE ENTROPY;

PROBABILITY DISTRIBUTIONS;

EID: 0036026966     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005382     Document Type: Article

References (9)

1. Aldous, D. and Diaconis, P. (1986) Shuffling cards and stopping times. Amer. Math. Monthly 93 333-348.
2. Alon, N. and Spencer, J. (1992) The Probabilistic Method, Wiley Interscience.
3. Barbour, A. D., Holst, L. and Janson, S. (1992) Poisson Approximation, Oxford University Press, Oxford.
4. Bayer, D. and Diaconis, P. (1992). Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294-313.
5. Diaconis, P. (1988) Group Representations in Probability and Statistics, IMS, Hayward, CA.
6. Diaconis, P., Fill, J. and Pitman, J. (1992). Analysis of top to random shuffles. Combin. Probab. Comput. 1 135-155.
7. Feller, W. (1968) An Introduction to Probability Theory and its Applications, Vol. 1, 3rd edn, Wiley, New York.
8. Stark, D., Ganesh, A. and O'Connell, N. (2002) Information loss in riffle shuffling. Combin. Probab. Comput. 11 79-95.
9. Trefethen, L. N. and Trefethen, L. M. (2000) How many shuffles to randomize a deck of cards?, Proc. Royal Soc. London A 456 2561-2568.