Mixing times for Markov chains on wreath products and related homogeneous spaces
James Allen Fill, Clyde H. Schoolfield,
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
Related papers
Sandpile avalanches in two dimensions are finite
Ahmed Bou-Rabee
Markov Chain Convergence in Kernel-Induced Geometry
Oleksii Kachaiev, Luc Brogat-Motte, Silvia Villa et al.
Interacting Stochastic Systems with Agent-Based Sampling and Connection-Based Reinforcement
Yogesh Dahiya, Gursharn Kaur, Neeraja Sahasrabudhe
Dimension-free Markov--Bernstein-type inequality for R2-valued polynomials
Egor Kosov
Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE
Akihiro Tanaka
Statistical inference for rough Burgers-type stochastic partial differential equations
Simon Chony Acosta Christian Olivera Ciprian Tudor