Skip to content

Mixing times for Markov chains on wreath products and related homogeneous spaces

James Allen Fill, Clyde H. Schoolfield,

math.PRarXiv:math/0006076

Abstract

We develop a method for analyzing the mixing times for a quite general class of Markov chains on the complete monomial group G Sn (the wreath product of a group G with the permutation group Sn) and a quite general class of Markov chains on the homogeneous space (G Sn) / (Sr × Sn - r). We derive an exact formula for the L2 distance in terms of the L2 distances to uniformity for closely related random walks on the symmetric groups Sj for 1 ≤ j ≤ n or for closely related Markov chains on the homogeneous spaces Si + j / (Si × Sj) for various values of i and j, respectively. Our results are consistent with those previously known, but our method is considerably simpler and more general.

Create a lesson