Abstract
Let P = G□H 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Bollobas, B., Brightwell, G.: Random walks and electrical resistances in product graphs. Discrete Applied Mathematics 73, 69–79 (1997)
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)
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)
Ding, J., Lee, J.R., Peres, Y.: Cover times, blanket times and majorizing measures (2010) (manuscript)
Doyle, P.G., Laurie Snell, J.: Random walks and electrical networks (2006)
Feige, U.: A tight upper bound for the cover time of random walks on graphs. Random Structures and Algorithms 6, 51–54 (1995)
Feige, U.: A tight lower bound for the cover time of random walks on graphs. Random Structures and Algorithms 6, 433–438 (1995)
Jonasson, J.: An upper Bound on the Cover Time for Powers of Graphs. Discrete Mathematics 222, 181–190 (2000)
Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times (2009)
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)
Winkler, P., Zuckerman, D.: Multiple Cover Time. Random Structures and Algorithms 9, 403–411 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdullah, M., Cooper, C., Radzik, T. (2011). The Cover Time of Cartesian Product Graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2010. Lecture Notes in Computer Science, vol 6460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19222-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-19222-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19221-0
Online ISBN: 978-3-642-19222-7
eBook Packages: Computer ScienceComputer Science (R0)