Abstract
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 subsets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldous, D. J. (1989). Hitting times for random walks on vertex-transitive graphs.Math. Proc. Cambridge Phil. Soc. 106, 179–191.
Aldous, D. J. (1989). An introduction to covering problems for random walks on graphs.J. Theor. Prob. 2, 87–89.
Aldous, D. J. (1989).Probability Approximations via the Poisson Clumping Heuristic. Springer-Verlag, New York.
Aldous, D. J. (1991). Random walk covering of some special trees.J. Math. Anal. Appl., (to appear).
Devroye, L., and Sbihi, A. (1988). Inequalities for Random Walks on Trees. Technical Report, McGill University, Montreal.
Flajolet, P., Kirschenhofer, P., and Tichy, R. F. (1988). Deviations from uniformity in random strings.Prob. Theor. Rel. Fields 80139–150.
Hall, P. (1988).Introduction to the Theory of Coverage Processes. Wiley, New York.
Matthews, P. C. (1988). Covering problems for Markov chains.Ann. Prob. 16, 1215–1228.
Mori, T. F. (1987). Maximum waiting time when the size of the alphabet increases. InMathematical Statistics and Probability Theory, Vol. B (Bad Tatzmannsdorf, 1986), Reidel, Boston, pp. 169–178.
Rhee, W., and Talagrand M. (1987). Martingale inequalities and NP-complete problems.Math. Oper. Res. 12, 177–181.
Zuckerman, D. (1989). Covering times of random walks on bounded degree trees and other graphs.J. Theor. Prob. 2, 147–157.
Zuckerman, D. (1989). A Technique for Lower Bounding the Cover Time. Technical Report, University of California at Berkeley.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aldous, D.J. Threshold limits for cover times. J Theor Probab 4, 197–211 (1991). https://doi.org/10.1007/BF01047002
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01047002