The Cover Time of Cartesian Product Graphs

  • Mohammed Abdullah
  • Colin Cooper
  • Tomasz Radzik
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6460)


Let P = GH be the cartesian product of graphs G,H. We relate the cover time COV[P] of P to the cover times of its factors. When one of the factors is in some sense larger than the other, its cover time dominates, and can become of the same order as the cover time of the product as a whole. Our main theorem effectively gives conditions for when this holds. The probabilistic technique which we introduce, based on the blanket time, is more general and may be of independent interest, as might some of our lemmas.


Random walks cover time blanket time effective resistance cartesian product graphs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  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: Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, pp. 218–223 (1979)Google Scholar
  2. 2.
    Bollobas, B., Brightwell, G.: Random walks and electrical resistances in product graphs. Discrete Applied Mathematics 73, 69–79 (1997)CrossRefzbMATHGoogle Scholar
  3. 3.
    Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Computational Complexity 6, 312–340 (1997)CrossRefzbMATHGoogle Scholar
  4. 4.
    Dembo, A., Peres, Y., Rosen, J., Zeitouni, O.: Cover times for Brownian motion and random walks in two dimensions. Ann. Math. 160, 433–464 (2004)CrossRefzbMATHGoogle Scholar
  5. 5.
    Ding, J., Lee, J.R., Peres, Y.: Cover times, blanket times and majorizing measures (2010) (manuscript)Google Scholar
  6. 6.
    Doyle, P.G., Laurie Snell, J.: Random walks and electrical networks (2006)Google Scholar
  7. 7.
    Feige, U.: A tight upper bound for the cover time of random walks on graphs. Random Structures and Algorithms 6, 51–54 (1995)CrossRefzbMATHGoogle Scholar
  8. 8.
    Feige, U.: A tight lower bound for the cover time of random walks on graphs. Random Structures and Algorithms 6, 433–438 (1995)CrossRefzbMATHGoogle Scholar
  9. 9.
    Jonasson, J.: An upper Bound on the Cover Time for Powers of Graphs. Discrete Mathematics 222, 181–190 (2000)CrossRefzbMATHGoogle Scholar
  10. 10.
    Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times (2009)Google Scholar
  11. 11.
    Matthews, P.: Covering problems for Brownian motion on spheres. Ann. Prob. 16, 189–199 (1988); Nash-Williams, C.S.J.A.: Random walk and electric currents in networks. Proc. Camb. Phil. Soc. 55, 181–194 (1959)CrossRefzbMATHGoogle Scholar
  12. 12.
    Winkler, P., Zuckerman, D.: Multiple Cover Time. Random Structures and Algorithms 9, 403–411 (1996)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mohammed Abdullah
    • 1
  • Colin Cooper
    • 1
  • Tomasz Radzik
    • 1
  1. 1.Department of Computer ScienceKing’s College LondonUK

Personalised recommendations