Journal of Theoretical Probability

, Volume 9, Issue 4, pp 983–993

Rate of convergence for shuffling cards by transpositions

  • Shirin Handjani
  • Douglas Jungreis

DOI: 10.1007/BF02214260

Cite this article as:
Handjani, S. & Jungreis, D. J Theor Probab (1996) 9: 983. doi:10.1007/BF02214260


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.

Key Words

Spectral gapshuffling cardsgraphsinterchange processrandom walk

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • Shirin Handjani
    • 1
  • Douglas Jungreis
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaLos Angeles