Multiple cover time

  title={Multiple cover time},
  author={Peter Winkler and David Zuckerman},
  journal={Random Struct. Algorithms},
Motivated by applications in Markov estimation and distributed computing, we define the blanket time of an undirected graph G to be the expected time for a random walk to hit every vertex of G within a constant factor of the number of times predicted by the stationary distribution. Thus the blanket time is, essentially, the number of steps required of a random walk in order that the observed distribution reflect the stationary distribution. We provide substantial evidence for the following… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 23 extracted citations


Publications referenced by this paper.
Showing 1-10 of 24 references

Lower bounds for covering times for reversible Markov chains and random walks on graphs

D. J. Aldous
J. Theoretical Probab. 2 #1 • 1989
View 7 Excerpts
Highly Influenced

Birthday paradox

P. Flajolet, D. Gardy, L. Thimonier
coupon collectors, caching algorithms and self-organizing search, Disc. Appl. Math. 39 • 1992

Inequalities for random walks on trees

L. Devroye, A. Sbihi
Random Graphs, A. Frieze and T. Luczak (eds.), Vol. 2, Wiley • 1992
View 1 Excerpt

A random polynomial time algorithm for estimating volumes of convex bodies

M. Dyer, A. Frieze, R. Kannan
J. ACM 38 #1 • 1991
View 1 Excerpt

Similar Papers

Loading similar papers…