Paper
Cryptography
Don Coppersmith
IBM J. Res. Dev
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.
Don Coppersmith
IBM J. Res. Dev
Don Coppersmith, Moshe Lewenstein
SIAM Journal on Discrete Mathematics
Don Coppersmith, Uriel Feige, et al.
SIAM Journal on Discrete Mathematics
Roy L. Adler, Don Coppersmith, et al.
IEEE Trans. Inf. Theory