Random motion on finite rings, II: Noncommutative rings
Abstract
We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition (resp. multiplication) distribution is uniform (resp. conjugacy invariant). We prove explicit formulas for some of the eigenvalues of the transition matrix and give lower bounds on their multiplicities. We also give recursive formulas for the stationary distribution and prove that the mixing time is bounded by an absolute constant. For the matrix rings M2( Fq), we compute the entire spectrum explicitly using the representation theory of GL2( Fq), as well as the stationary probabilities.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.