Rate of convergence for shuffling cards by transpositions
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Suppose we are given a graph with a label on each vertex and a rate assigned to each edge, and suppose that edges flip (that is, the labels at the two endpoints switch) randomly with the given rates. We consider two Markov processes on this graph: one whose states are the permutations of then labels, and one whose states are the positions of a single label. We show that for several classes of graphs these two processes have the same spectral gap.
- Aldous, D. (1994). Unpublished manuscript.
- Bacher, R. (1992). Valeur propre minimale du laplacien de coxeter pour le groupe symetrique. Preprint.
- Diaconis, P., and Saloff-Coste, L. (1993). Comparison techniques for random walk on finite groups.Ann. Prob. 21, 2131–2156.
- Diaconis, P., and Shahshahani, M. (1981). Generating a random permutation with random transpositions.Z. Wahrsch. Verw. Geb. 57, 159–179.
- Flatto, L., Odlyzko, A. M., and Wales, D. B. (1985). Random shuffles and group representations.Ann. Prob. 13, 154–178.
- Liggett, T. (1989). ExponentialL 2 convergence of attractive reversible nearest particle systems.Ann. Prob. 17, 403–432.
- Rate of convergence for shuffling cards by transpositions
Journal of Theoretical Probability
Volume 9, Issue 4 , pp 983-993
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers-Plenum Publishers
- Additional Links
- Spectral gap
- shuffling cards
- interchange process
- random walk
- Industry Sectors