Article Dans Une Revue International Journal of Algebra and Computation Année : 2015

Markov chains, $\mathscr R$-trivial monoids and representation theory

Résumé

We develop a general theory of Markov chains realizable as random walks on -trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via Möbius inversion along a lattice, a condition for diagonalizability of the transition matrix and some techniques for bounding the mixing time. In addition, we discuss several examples, such as Toom–Tsetlin models, an exchange walk for finite Coxeter groups, as well as examples previously studied by the authors, such as nonabelian sandpile models and the promotion Markov chain on posets. Many of these examples can be viewed as random walks on quotients of free tree monoids, a new class of monoids whose combinatorics we develop.

Dates et versions

hal-01121178 , version 1 (27-02-2015)

Identifiants

Citer

Arvind Ayyer, Anne Schilling, Benjamin Steinberg, Nicolas M. Thiéry. Markov chains, $\mathscr R$-trivial monoids and representation theory. International Journal of Algebra and Computation, 2015, pp.1540008. ⟨10.1142/s0218196715400081⟩. ⟨hal-01121178⟩
226 Consultations
0 Téléchargements

Altmetric

Partager

  • More