Alok Aggarwal, Don Coppersmith, et al.
Information Processing Letters
We present an upper bound O(n2) for the mixing time of a simple random walk on upper triangular matrices. We show that this bound is sharp up to a constant, and find tight bounds on the eigenvalue gap. We conclude by applying our results to indicate that the asymmetric exclusion process on a circle indeed mixes more rapidly than the corresponding symmetric process.
Alok Aggarwal, Don Coppersmith, et al.
Information Processing Letters
Don Coppersmith
IEEE Trans. Inf. Theory
Don Coppersmith, Michael Elkin
SODA 2005
Nikhil Bansal, Danny Z. Chen, et al.
Algorithmica (New York)