Super-character theory and comparison arguments for a random walk on the upper triangular matrices
Probability
2018-08-27 v2 Combinatorics
Representation Theory
Abstract
Consider the random walk on the upper triangular matrices with ones on the diagonal and elements over where we pick a row at random and either add it or subtract it from the row directly above it. The main result of this paper is to prove that the dependency of the mixing time on is . This is proven by combining super-character theory and comparison theory arguments.
Keywords
Cite
@article{arxiv.1609.01238,
title = {Super-character theory and comparison arguments for a random walk on the upper triangular matrices},
author = {Evita Nestoridi},
journal= {arXiv preprint arXiv:1609.01238},
year = {2018}
}
Comments
15 pages