Mixing of the upper triangular matrix walk

From MaRDI portal



Abstract: We study a natural random walk over the upper triangular matrices, with entries in the field , generated by steps which add row i+1 to row i. We show that the mixing time of the lazy random walk is O(n2) which is optimal up to constants. Our proof makes key use of the linear structure of the group and extends to walks on the upper triangular matrices over the fields for q prime.












This page was built for publication: Mixing of the upper triangular matrix walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q365712)