Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-05T15:34:25.382Z Has data issue: false hasContentIssue false
  • English
  • Français

Comparison techniques for card shuffling

Published online by Cambridge University Press:  01 July 2016

P. Diaconis
P. Diaconis*
Affiliation:
Harvard University
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Invited Papers
Information
Advances in Applied Probability , Volume 24 , Issue 4 , December 1992 , pp. 766
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Diaconis, P. and Stroock, D. (1991) Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob. 1, 36–61.CrossRefGoogle Scholar
Diaconis, P. and Saloff-Coste, L. (1991) Comparison theorems for random walks on groups. Technical report, Department of Mathematics, Harvard University.Google Scholar