Tensor product Markov chains (Q2193247)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Tensor product Markov chains
    scientific article

      Statements

      Tensor product Markov chains (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      25 August 2020
      0 references
      The authors analyze families of Markov chains that arise from decomposing tensor products of irreducible representations. This illuminates the Burnside-Brauer theorem for building irreducible representations, the McKay correspondence, and Pitman's \(2M - X\) theorem. The chains are explicitly diagonalizable, and the use of eigenvalues/eigenvectors allows them to give sharp rates of convergence for the associated random walks. For modular representations, the chains are not reversible, and the analysis becomes intricate. In the quantum group case, the chains fail to be diagonalizable, but a novel analysis using generalized eigenvectors proves successful. Section 2 gives a review on the available literature; Section 3 contains some basic results for tensor product Markov chains in the modular case and gives sharp rates of convergence for the groups \(\mathrm{SL}_2(p)\) with respect to tensoring with the natural two-dimensional module and with the Steinberg module. Section 4 treats \(\mathrm{SL}_2(p^2)\), Section 5 features \(\mathrm{SL}_2(2^n)\), and Section 6 considers \(\mathrm{SL}_3(p)\). Section 7 examines the case of quantum \(\mathrm{SL}_2\) at a root of unity. Two appendices provide introductory information about Markov chains and modular representations.
      0 references
      tensor product
      0 references
      Markov chain
      0 references
      McKay correspondence
      0 references
      modular representation
      0 references
      Brauer character
      0 references
      quantum group
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references