Rate of convergence for shuffling cards by transpositions

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 stares are the permutations of the n 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.