A strong uniform time for random transpositions
The author considers a deck of cards. At each step two cards are chosen by the left and right hands and transposed. After a large number k of steps the distribution \(\mu^ k\) of the resulting permutation is close to the uniform distribution \({\mathcal U}\). The author gives sharp upper and lower bounds for the distance between \(\mu^ k\) and \({\mathcal U}\), using the method of strong uniform time introduced by Aldous and Diaconis.
scientific article; zbMATH DE number 4180461
scientific article