Don Coppersmith
Journal of Cryptology
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
Journal of Cryptology
Don Coppersmith, Jon Lee
Discrete Optimization
Inder Gopal, Don Coppersmith, et al.
IEEE Transactions on Communications
Don Coppersmith
STOC 1984