The ergodic theorem for random walks on finite quantum groups

From MaRDI portal
Publication:5159795

DOI10.1080/00927872.2021.1908551zbMATH Open1482.46080arXiv2004.01234OpenAlexW3153460196MaRDI QIDQ5159795FDOQ5159795


Authors:


Publication date: 28 October 2021

Published in: Communications in Algebra (Search for Journal in Brave)

Abstract: Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving probability: a random walk on a finite group is ergodic if and only if the support is not concentrated on a proper subgroup, nor on a coset of a proper normal subgroup. The study of random walks on finite groups extends naturally to the study of random walks on finite quantum groups, where a state on the algebra of functions plays the role of the driving probability. Necessary and sufficient conditions for ergodicity of a random walk on a finite quantum group are given on the support projection of the driving state.


Full work available at URL: https://arxiv.org/abs/2004.01234




Recommendations




Cites Work


Cited In (9)





This page was built for publication: The ergodic theorem for random walks on finite quantum groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159795)