How to Design a Linear Cover Time Random Walk on a Finite Graph

  • Yoshiaki Nonaka
  • Hirotaka Ono
  • Kunihiko Sadakane
  • Masafumi Yamashita
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5792)

Abstract

A random walk on a finite graph G = (V,E) is random token circulation on vertices of G. A token on a vertex in V moves to one of its adjacent vertices according to a transition probability matrix P. It is known that both of the hitting time and the cover time of the standard random walk are bounded by O(|V|3), in which the token randomly moves to an adjacent vertex with the uniform probability. This estimation is tight in a sense, that is, there exist graphs for which the hitting time and cover times of the standard random walk are \({\it \Omega}(|V|^3)\). Thus the following questions naturally arise: is it possible to speed up a random walk, that is, to design a transition probability for G that achieves a faster cover time? Or, how large (or small) is the lower bound on the cover time of random walks on G? In this paper, we investigate how we can/cannot design a faster random walk in terms of the cover time. We give necessary conditions for a graph G to have a linear cover time random walk, i,e., the cover time of the random walk on G is O(|V|). We also present a class of graphs that have a linear cover time. As a byproduct, we obtain the lower bound \({\it \Omega}(|V|\log |V|)\) of the cover time of any random walk on trees.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proc. 20th Symposium on Foundations of Computer Science, pp. 218–223 (1979)Google Scholar
  2. 2.
    Aldous, D.J.: On the time taken by random walks on finite groups to visit every state. Z. Wahrsch. verw. Gebiete 62, 361–363 (1983)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Aldous, D.J., Fill, J.: Reversible Markov Chains and Random Walks on Graphs, http://www.stat.berkeley.edu/users/aldous/RWG/book.html
  4. 4.
    Brightwell, G., Winkler, P.: Maximum hitting time for random walks on graphs. Journal of Random Structures and Algorithms 3, 263–276 (1990)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Feige, U.: A tight upper bound on the cover time for random walks on graphs. Journal of Random Structures and Algorithms 6, 51–54 (1995)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Feige, U.: A tight lower bound on the cover time for random walks on graphs. Journal of Random Structures and Algorithms 6, 433–438 (1995)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Feller, W.: An Introduction to Probability Theory and its Applications, vol. 1. Wiley, New York (1967)MATHGoogle Scholar
  8. 8.
    Gilks, W.R., Richardson, S., Spiegelhalter, D.J.: Markov Chain Monte Carlo in Practice. Chapman & Hall, Boca Raton (1996)MATHGoogle Scholar
  9. 9.
    Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97–109 (1970)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Ikeda, S., Kubo, I., Okumoto, N., Yamashita, M.: Impact of Local Topological Information on Random Walks on Finite Graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1054–1067. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Ikeda, S., Kubo, I., Yamashita, M.: The hitting and cover times of random walks on finite graphs using local degree information. Theoretical Computer Science 410(1), 94–100 (2009)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Lovász, L.: Random walks on graphs: Survey. In: Bolyai Society, Mathematical Studies 2, Combinatorics, Paul Erd\(\ddot{o}\)s is Eighty, Keszthely, Hungary, vol. 2, pp. 1–46 (1993)Google Scholar
  13. 13.
    Matthews, P.: Covering Problems for Markov Chain. The Annals of Probability 16(3), 1215–1228 (1988)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equations of state calculations by fast computing machine. Journal of Chemical Physics 21, 1087–1091 (1953)CrossRefGoogle Scholar
  15. 15.
    Motowani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)CrossRefGoogle Scholar
  16. 16.
    Nonaka, Y., Ono, H., Sadakane, K., Yamashita, M.: The Hitting and Cover Times of Metropolis Walks (submitted for publication)Google Scholar
  17. 17.
    Sinclair, A.: Algorithms for Random Generation & Counting. Birkhäuser, Boston (1993)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Yoshiaki Nonaka
    • 1
  • Hirotaka Ono
    • 1
    • 2
  • Kunihiko Sadakane
    • 3
  • Masafumi Yamashita
    • 1
    • 2
  1. 1.Department of InformaticsKyushu UniversityJapan
  2. 2.Institute of Systems, Information Technologies and Nanotechnologies (ISIT)Japan
  3. 3.Principles of Informatics Research DivisionNational Institute of InformaticsJapan

Personalised recommendations