Markovian Linearization of Random Walks on Groups
From MaRDI portal
Abstract: In operator algebra, the linearization trick is a technique that reduces the study of a non-commutative polynomial evaluated at elements of an algebra A to the study of a polynomial of degree one, evaluated on the enlarged algebra A x M r (C), for some integer r. We introduce a new instance of the linearization trick which is tailored to study a finitely supported random walk on a group G by studying instead a nearest-neighbor colored random walk on G x {1,. .. , r}, which is much simpler to analyze. As an application we extend well-known results for nearest-neighbor walks on free groups and free products of finite groups to colored random walks, thus showing how one can obtain explicit formulas for the drift and entropy of a finitely supported random walk.
Recommendations
Cited in
(5)- A decomposition of Markov processes via group actions
- Exact coupling of random walks on Polish groups
- Connection between Markov chains on finite simple groups and fundamental groups
- Dimension drop of harmonic measure for some finite range random walks on Fuchsian Schottky groups
- Random walks on groups and monoids with a Markovian harmonic measure
This page was built for publication: Markovian Linearization of Random Walks on Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155926)