论文信息 - A Tight Lower Bound on the Cover Time for Random Walks on Graphs - 字舞流文

A Tight Lower Bound on the Cover Time for Random Walks on Graphs

We prove that the expected time for a random walk to cover all n vertices of a graph is at least (1 + o(1))n In n. © 1995 Wiley Periodicals, Inc.

Uriel Feige | U. Feige

[1] D. Aldous. An introduction to covering problems for random walks on graphs , 1989 .

[2] Peter Winkler,et al. Extremal cover times for random walks on trees , 1990, J. Graph Theory.

[3] Prabhakar Raghavan,et al. The electrical resistance of a graph captures its commute and cover times , 1989, STOC '89.

[4] David Zuckerman. A Technique for Lower Bounding the Cover Time , 1992, SIAM J. Discret. Math..

[5] P. Matthews. Covering Problems for Brownian Motion on Spheres , 1988 .

[6] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7] P. Tetali. Random walks and the effective resistance of networks , 1991 .

[8] Peter Winkler,et al. Collisions Among Random Walks on a Graph , 1993, SIAM J. Discret. Math..

[9] Anna R. Karlin,et al. Bounds on the cover time , 1989 .

[10] N. Linial,et al. On the cover time of random walks on graphs , 1989 .

[11] Uriel Feige. Collecting Coupons on Trees, and the Analysis of Random Walks , 1993 .

[12] Peter Winkler,et al. Maximum itting Time for Random Walks on Graphs , 1990, Random Struct. Algorithms.

[13] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .