SearcharxivSearch

arXiv · 2311.02723

A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle

Abstract

Let $Q$ be a probability measure on a finite group $G$, and let $H$ be a subgroup of $G$. We show that a necessary and sufficient condition for the random walk driven by $Q$ on $G$ to induce a Markov chain on the double coset space $H\backslash G/H$, is that $Q(gH)$ is constant as $g$ ranges over any double coset of $H$ in $G$. We obtain this result as a corollary of a more general theorem on the double cosets $H \backslash G / K$ for $K$ an arbitrary subgroup of $G$. As an application we study a variation on the $r$-top to random shuffle which we show induces an irreducible, recurrent, reversible and ergodic Markov chain on the relevant double cosets. The transition matrix of the induced walk has remarkable spectral properties: we find its invariant distribution and its eigenvalues and hence determine its rate of convergence.

Explore related subjects

Keep this discovery

BibTeXRIS

John R. Britnell, Mark Wildon. 2023-11-05. A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle. https://arxiv.org/abs/2311.02723

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR