Multiple cover time

Random Structures and Algorithms

Volumn 9, Issue 4, 1996, Pages 403-411

  Winkler, Peter ^a   Zuckerman, David ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Blanket time; Coupon collecting; Cover time; Cycle; Graph; Path; Random walk

Indexed keywords

EID: 0030491070     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199612)9:4<403::AID-RSA4>3.0.CO;2-0     Document Type: Article

References (24)

1. D. J. Aldous, On the time taken by random walks on finite groups to visit every state, Z. Wahrsch. Verw. Gebiete, 62, 361-374 (1983).
2. D. J. Aldous, Lower bounds for covering times for reversible Markov chains and random walks on graphs, J. Thoer. Probab., 2, 91-100 (1989).
3. D. J. Aldous, personal communication, 1993.
4. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, Proc. 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1979, pp. 218-223.
5. D. Angluin, Learning regular sets from queries and counterexamples, Inf. Comput., 75, 87-106 (1987).
6. A. Broder and A. R. Karlin, Bounds on covering times, J. Theor. Probab., 2(1), 101-120.
7. A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari, The electrical resistance of a graph, and its applications to random walks, Proc. 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 574-586.
8. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat., 23, 493-509 (1952).
9. D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random walks on weighted graphs and applications to on-line algorithms, J. ACM, 40(3), 421-453 (1993).
10. P. Dagum, M. Luby, M. Mihail, and U. Vazirani, Polytopes, permanents and graphs with large factors, Proc. 29th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 412-421.
11. L. Devroye and A. Sbihi, Inequalities for random walks on trees, in Random Graphs, A. Frieze and T. Łuczak, Eds., Wiley, New York, 1992, Vol. 2.
12. M. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for estimating volumes of convex bodies, J. ACM, 38(1) 1-17 (1991).
13. P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Appl. Math., 39, 207-229, (1992).
14. L. Holst, On birthday, collectors', occupancy and other classical urn problems, Int. Stat. Rev., 54(1), 15-27 (1986).
15. A. Israeli and M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, Proc. 9th Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, 1990, pp. 119-131.
16. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput., 18(6), 1149-1178 (1989).
17. V. F. Kolchin, B. A. Sevast'yanov, and V. P. Chistyakov, Random Allocations Winston, Washington, DC, 1978.
18. P. C. Matthews, Covering problems for Brownian motion on spheres, Ann. Probab., 16, 189-199 (1988).
19. R. L. Rivest and R. E. Schapire, Inference of finite automata using homing sequences, In. Comput., 103(2), 299-347 (1993).
20. R. Rubingfeld, The cover time of a regular expander is O(n log n), Inf. Process. Lett. 35, 49-51 (1990).
21. H. von Schelling, Coupon collecting for unequal probabilities, Amer. Math. Mon., 61, 306-311 (1954).
22. D. Williams, Diffusions, Markov Processes and Martingales, Wiley, New York, 1979, Vol. 1, see pp. 11-12.
23. D. Zuckerman, Covering times of random walks on bounded degree trees and other graphs, J. Theor. Probab., 2(1), 147-157 (1989).
24. D. Zuckerman, A technique for lower bounding the cover time, SIAM J. Discrete Math., 5, 81-87 (1992).