Don Coppersmith
Mathematics of Computation
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
Mathematics of Computation
Don Coppersmith, S.E. June Hong, et al.
Data Mining and Knowledge Discovery
Don Coppersmith
Cryptologia
Don Coppersmith, Ravi Kumar
SODA 2004