Skip to main content
Springer Nature Link
Log in

The Cover Time of Deterministic Random Walks

  • Conference paper
Computing and Combinatorics (COCOON 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6196))

Included in the following conference series:

Abstract

The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this “deterministic random walk” covers all vertices (or all edges). We present general techniques to derive upper bounds for the vertex and edge cover time and derive matching lower bounds for several important graph classes. Depending on the topology, the deterministic random walk can be asymptotically faster, slower or equally fast compared to the classical random walk.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aldous, D.: On the time taken by random walks on finite groups to visit every state. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 361–374 (1983)

    Google Scholar 

  2. Aleliunas, R., Karp, R., Lipton, R., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’79), pp. 218–223 (1979)

    Google Scholar 

  3. Bampas, E., Gasieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., Kosowski, A.: Euler tour lock-in problem in the rotor-router model. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 423–435. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Broder, A., Karlin, A.: Bounds on the cover time. Journal of Theoretical Probability 2(1), 101–120 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chandra, A., Raghavan, P., Ruzzo, W., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Computational Complexity 6(4), 312–340 (1997)

    Article  MathSciNet  Google Scholar 

  6. Cooper, C., Frieze, A.: The cover time of random regular graphs. SIAM Journal of Discrete Mathematics 18(4), 728–740 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cooper, C., Frieze, A.: The cover time of the giant component of a random graph. Random Structures & Algorithms 32(4), 401–439 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cooper, C., Frieze, A.: The cover time of random geometric graphs. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’09) , pp. 48–57 (2009)

    Google Scholar 

  9. Cooper, C., Ilcinkas, D., Klasing, R., Kosowski, A.: Derandomizing random walks in undirected graphs using locally fair exploration strategies. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 411–422. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Cooper, J., Spencer, J.: Simulating a random walk with constant error. Combinatorics, Probability & Computing 15, 815–822 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Cooper, J., Doerr, B., Spencer, J., Tardos, G.: Deterministic random walks on the integers. European Journal of Combinatorics 28(8), 2072–2090 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  12. Cooper, J., Doerr, B., Friedrich, T., Spencer, J.: Deterministic random walks on regular trees. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’08), pp. 766–772 (2008)

    Google Scholar 

  13. Diaconis, P., Saloff-Coste, L.: Comparison theorems for reversible Markov chains. Annals of Applied Probability 3(3), 696–730 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Doerr, B., Friedrich, T.: Deterministic random walks on the two-dimensional grid. Combinatorics, Probability & Computing 18(1-2), 123–144 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  15. Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’08), pp. 773–781 (2008)

    Google Scholar 

  16. Dumitriu, I., Tetali, P., Winkler, P.: On playing golf with two balls. SIAM J. Discrete Math. 16(4), 604–615 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Feige, U.: A tight lower bound for the cover time of random walks on graphs. Random Structures & Algorithms 6(4), 433–438 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  18. Feige, U.: Collecting coupons on trees, and the cover time of random walks. Computational Complexity 6(4), 341–356 (1997)

    Article  MathSciNet  Google Scholar 

  19. Friedrich, T., Sauerwald, T.: Near-perfect load balancing by randomized rounding. In: 41st Annual ACM Symposium on Theory Progarmming (STOC’09), pp. 121–130 (2009)

    Google Scholar 

  20. Friedrich, T., Gairing, M., Sauerwald, T.: Quasirandom load balancing. In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’10), pp. 1620–1629 (2010)

    Google Scholar 

  21. Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’07) , pp. 585–594 (2007)

    Google Scholar 

  22. Holroyd, A.E., Propp, J.: Rotor walks and markov chains (2009), arXiv:0904.4507

    Google Scholar 

  23. Korf, R.E.: Real-time heuristic search. Artif. Intell. 42(2-3), 189–211 (1990)

    Article  MATH  Google Scholar 

  24. Levine, L., Peres, Y.: Spherical asymptotics for the rotor-router model in ℤd. Indiana Univ. Math. J. 57, 431–450 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  25. Levine, L., Peres, Y.: Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile. Potential Analysis 30, 1–27 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  26. Lovász, L.: Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty 2, 1–46 (1993)

    Google Scholar 

  27. Palacios, J.L.: Expected hitting and cover times of random walks on some special graphs. Random Structures & Algorithms 5(1), 173–182 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  28. Priezzhev, V.B., Dhar, D., Dhar, A., Krishnamurthy, S.: Eulerian walkers as a model of self-organized criticality. Phys. Rev. Lett. 77, 5079–5082 (1996)

    Article  Google Scholar 

  29. Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of Markov chains and the analysis of iterative load balancing schemes. In: 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’98), pp. 694–705 (1998)

    Google Scholar 

  30. Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4) (2008)

    Google Scholar 

  31. Rubinfeld, R.: The cover time of a regular expander is \(\mathcal{O}(n \log n)\). Inf. Process. Lett. 35(1), 49–51 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  32. Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Smell as a computational resource - a lesson we can learn from the ant. In: Israeli Symposium on Theory of Computing and Systems (ISTCS ’96), pp. 219–230 (1996)

    Google Scholar 

  33. Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Distributed covering by ant-robots using evaporating traces. IEEE Transactions on Robotics and Automation 15(5), 918–933 (1999)

    Article  Google Scholar 

  34. Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37(3), 165–186 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  35. Zuckerman, D.: On the time to traverse all edges of a graph. Inf. Process. Lett. 38(6), 335–337 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  36. Zuckerman, D.: A technique for lower bounding the cover time. SIAM Journal on Discrete Mathematics 5(1), 81–87 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Campus E1.4, 66123, Saarbrücken, Germany

    Tobias Friedrich

  2. Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada

    Thomas Sauerwald

Authors
  1. Tobias Friedrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Sauerwald
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Florida, CSE Building, Room 566, P.O. Box 116120, 32611-6120, Gainesville, Florida, USA

    My T. Thai

  2. Department of Computer and Information Science and Technology, University of Florida, P.O. Box, USA

    Sartaj Sahni

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Friedrich, T., Sauerwald, T. (2010). The Cover Time of Deterministic Random Walks. In: Thai, M.T., Sahni, S. (eds) Computing and Combinatorics. COCOON 2010. Lecture Notes in Computer Science, vol 6196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14031-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14031-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14030-3

  • Online ISBN: 978-3-642-14031-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy