Random motion on finite rings, II: Noncommutative rings
Arvind Ayyer, Pooja Singla

TL;DR
This paper generalizes the analysis of Markov chains on finite rings to include noncommutative rings, providing explicit eigenvalues, stationary distributions, and mixing times, with detailed results for matrix rings over finite fields.
Contribution
It extends previous work from commutative to noncommutative finite rings, deriving explicit spectral formulas and stationary distributions for these more complex algebraic structures.
Findings
Eigenvalues of transition matrices are explicitly characterized.
Stationary distributions are computed recursively.
Mixing times are bounded by a universal constant.
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 we compute the entire spectrum explicitly using the representation theory of as well as the stationary probabilities.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Algebra and Geometry · Random Matrices and Applications
