Summary: Threshold Limits for Cover Times
David J Aldous
Department of Statistics
University of California
Berkeley CA 94720
Under a natural hypothesis, the cover time for a finite Markov chain
can be approximated by its expectation, as the size of state space tends
to infinity. This result is deduced from an abstract result concerning
covering an unstructured set by i.i.d. arbitrarily-distributed random
running head: Threshold limits for cover times.
key words. cover time, Markov chain, random walk on graph, threshold
J. Theoretical Probability 4 (1991) 197-211.
Research supported by N.S.F. Grant MCS87-01426
Our results are easier to state than to motivate: so we give brisk statements