A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
HTML articles powered by AMS MathViewer
- by John R. Britnell and Mark Wildon;
- Proc. Amer. Math. Soc. 152 (2024), 3265-3274
- DOI: https://doi.org/10.1090/proc/16853
- Published electronically: June 20, 2024
- HTML | PDF | Request permission
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 double cosets of $\mathrm {Sym}_r \times \mathrm {Sym}_{n-r}$ in $\mathrm {Sym}_n$. 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.References
- Dave Bayer and Persi Diaconis, Trailing the dovetail shuffle to its lair, Ann. Appl. Probab. 2 (1992), no. 2, 294–313. MR 1161056
- Samuel Boardman, Daniel Rudolf, and Laurent Saloff-Coste, The hit-and-run version of top-to-random, J. Appl. Probab. 59 (2022), no. 3, 860–879. MR 4480084, DOI 10.1017/jpr.2021.96
- Kenneth S. Brown and Persi Diaconis, Random walks and hyperplane arrangements, Ann. Probab. 26 (1998), no. 4, 1813–1854. MR 1675083, DOI 10.1214/aop/1022855884
- John R. Britnell and Mark Wildon, Bell numbers, partition moves and the eigenvalues of the random-to-top shuffle in Dynkin types A, B and D, J. Combin. Theory Ser. A 148 (2017), 116–144. MR 3603317, DOI 10.1016/j.jcta.2016.12.003
- John R. Britnell and Mark Wildon, Involutive random walks on total orders and the anti-diagonal eigenvalue property, Linear Algebra Appl. 641 (2022), 1–47. MR 4374887, DOI 10.1016/j.laa.2022.01.018
- Persi Diaconis, James Allen Fill, and Jim Pitman, Analysis of top to random shuffles, Combin. Probab. Comput. 1 (1992), no. 2, 135–155. MR 1179244, DOI 10.1017/S0963548300000158
- Persi Diaconis and Laurent Saloff-Coste, Comparison theorems for reversible Markov chains, Ann. Appl. Probab. 3 (1993), no. 3, 696–730. MR 1233621
- Persi Diaconis and Mackenzie Simper, Statistical enumeration of groups by double cosets. part A, J. Algebra 607 (2022), no. part A, 214–246. MR 4441319, DOI 10.1016/j.jalgebra.2021.05.010
- Persi Diaconis, Arun Ram, and Mackenzie Simper, Double coset Markov chains, Forum Math. Sigma 11 (2023), Paper No. e2, 45. MR 4530094, DOI 10.1017/fms.2022.106
- Jason Fulman, Card shuffling and the decomposition of tensor products, Pacific J. Math. 217 (2004), no. 2, 247–262. MR 2109933, DOI 10.2140/pjm.2004.217.247
- John G. Kemeny and J. Laurie Snell, Finite Markov chains, Undergraduate Texts in Mathematics, Springer-Verlag, New York-Heidelberg, 1976. Reprinting of the 1960 original. MR 410929, DOI 10.1007/978-1-4684-9455-6
- David A. Levin and Yuval Peres, Markov chains and mixing times, American Mathematical Society, Providence, RI, 2017. Second edition of [ MR2466937]; With contributions by Elizabeth L. Wilmer; With a chapter on “Coupling from the past” by James G. Propp and David B. Wilson. MR 3726904, DOI 10.1090/mbk/107
- Hiroyuki Ochiai, Makiko Sasada, Tomoyuki Shirai, and Takashi Tsuboi, Eigenvalue problem for some special class of anti-triangular matrices, arXiv:1403.6797 (March 2014), 23 pages.
- C. Y. Amy Pang, Lumpings of algebraic Markov chains arise from subquotients, J. Theoret. Probab. 32 (2019), no. 4, 1804–1844. MR 4020688, DOI 10.1007/s10959-018-0834-0
- R. M. Phatarfod, On the matrix occurring in a linear search problem, J. Appl. Probab. 28 (1991), no. 2, 336–346. MR 1104570, DOI 10.1017/s0021900200039723
- D. P. Robbins and E. D. Bolker, The bias of three pseudorandom shuffles, Aequationes Math. 22 (1981), no. 2-3, 268–292. MR 645423, DOI 10.1007/BF02190184
- Jeffrey S. Rosenthal, Convergence rates for Markov chains, SIAM Rev. 37 (1995), no. 3, 387–405. MR 1355507, DOI 10.1137/1037083
- Mackenzie Simper, Random transpositions on contingency tables, arXiv:2208.10700v1 (August 2022), 39 pages.
Bibliographic Information
- John R. Britnell
- Affiliation: School of Mathematics, Statistics and Physics, Newcastle University, Newcastle Upon Tyne, NE1 7RU, United Kingdom
- MR Author ID: 703448
- Email: John.Britnell1@newcastle.ac.uk
- Mark Wildon
- Affiliation: Heilbronn Institute for Mathematical Research, School of Mathematics, University of Bristol, Woodland Road, Bristol BS8 1UG, United Kingdom
- MR Author ID: 727489
- Email: mark.wildon@bristol.ac.uk
- Received by editor(s): November 13, 2023
- Received by editor(s) in revised form: February 11, 2024
- Published electronically: June 20, 2024
- Communicated by: Martin Liebeck
- © Copyright 2024 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 152 (2024), 3265-3274
- MSC (2020): Primary 20A05; Secondary 15A18, 15B51, 60G10, 60J10
- DOI: https://doi.org/10.1090/proc/16853
- MathSciNet review: 4767261