Weak lumping of left-invariant random walks on left cosets of finite groups
Abstract
Let be a finite group and let be a subgroup of . The left-invariant random walk driven by a probability measure on is the Markov chain in which from any state , the probability of stepping to is . The initial state is chosen randomly according to a given distribution. The walk is said to lump weakly on left cosets if the induced process on is a time-homogeneous Markov chain. We characterise all the initial distributions and weights such that the walk is irreducible and lumps weakly on left cosets, and determine all the possible transition matrices of the induced Markov chain. In the case where is abelian we refine our main results to give a necessary and sufficient condition for weak lumping by an explicit system of linear equations on , organized by the double cosets . As an application we consider shuffles of a deck of cards such that repeated observations of the top card form a Markov chain. Such shuffles include the random-to-top shuffle, and also, when the deck is started in a uniform random order, the top-to-random shuffle. We give a further family of examples in which our full theory of weak lumping is needed to verify that the top card sequence is Markov.
Cite
@article{arxiv.2412.19742,
title = {Weak lumping of left-invariant random walks on left cosets of finite groups},
author = {Edward Crane and Álvaro Gutiérrez and Erin Russell and Mark Wildon},
journal= {arXiv preprint arXiv:2412.19742},
year = {2024}
}
Comments
85 pages, 3 figures