Abstract
We study a natural random walk on the n× n uni-upper triangular matrices, with entries in Z/ mZ , generated by steps which add or subtract a uniformly random row to the row above. We show that the mixing time of this random walk is O(m2nlog n+ n2mo(1)) . This answers a question of Stong and of Arias-Castro, Diaconis, and Stanley.
Original language | English (US) |
---|---|
Pages (from-to) | 571-601 |
Number of pages | 31 |
Journal | Probability Theory and Related Fields |
Volume | 187 |
Issue number | 3-4 |
DOIs | |
State | Published - Dec 2023 |
All Science Journal Classification (ASJC) codes
- Analysis
- Statistics and Probability
- Statistics, Probability and Uncertainty
Keywords
- Markov chains
- Mixing times
- Upper triangular matrices