Rate of convergence for shuffling cards by transpositions |
| |
Authors: | Shirin Handjani Douglas Jungreis |
| |
Affiliation: | (1) Department of Mathematics, University of California, 90024 Los Angeles, California |
| |
Abstract: | 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. |
| |
Keywords: | Spectral gap shuffling cards graphs interchange process random walk |
本文献已被 SpringerLink 等数据库收录! |