Mixing time of the upper triangular matrix walk over Z/mZ
Mixing time of the upper triangular matrix walk over Z/mZ
-
Evita Nestoridi, Princeton
We study a natural random walk over the upper triangular matrices, with听entries in Z/mZ, generated by steps which add or subtract row $i + 1$ to row听$i$. We show that the mixing time of the lazy random walk is $O(n^2m^2)$听which is optimal up to constants. This generalizes a result of Peres and Sly听and answers a question of Stong and of Arias-Castro, Diaconis and Stanley.听This is joint work with Allan Sly.