Markovian linearization of random walks on groups - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Mathematics Research Notices Année : 2022

Markovian linearization of random walks on groups

Résumé

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 ⊗ 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 nearestneighbor colored random walk on G × {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.
Fichier principal
Vignette du fichier
linearization_entropy3.pdf (797.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03029424 , version 1 (10-12-2020)

Identifiants

Citer

Charles Bordenave, Bastien Dubail. Markovian linearization of random walks on groups. International Mathematics Research Notices, In press, ⟨10.1093/imrn/rnac045⟩. ⟨hal-03029424⟩
151 Consultations
126 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More