Mixing time of a matrix random walk generated by elementary transvections

DOI10.1214/25-ECP727MaRDI QIDQ6907685zbMATH OpenFDO

Authors Anna Ben-Hamou

Publication date 1 November 2025

Published in Electronic Communications in Probability (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1214/25-ECP727

zbMATH Keywords

logarithmic Sobolev inequalityMarkov chainmatrix random walkmixing times

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites work

• Cutoff for a stratified random walk on the hypercube
• Cutoff for product replacement on finite groups
• Generating random elements in \(SL_ n(F_ q)\) by random transvections
• scientific article; zbMATH DE number 1047461 (Why is no real title available?)
• KAZHDAN CONSTANTS FOR SL_n(ℤ)
• Logarithmic Sobolev inequalities for finite Markov chains
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mixing of the upper triangular matrix walk
• On the complexity of matrix reduction over finite fields
• The random walk on upper triangular matrices over \(\mathbb{Z} / m\mathbb{Z}\)
• Walks on generating sets of Abelian groups

This page was built for publication: Mixing time of a matrix random walk generated by elementary transvections

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