SpringerLink
Log in

Random Walks and Undirected Graph Connectivity: A Survey

  • Conference paper
Discrete Probability and Algorithms

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 72))

Abstract

We survey a number of algorithms that decide connectivity in undirected graphs. Our focus is on the use of random walks as a tool in reducing the space complexity of these algorithms.

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
EUR 32.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
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 85.59
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 116.04
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 105.49
Price includes VAT (France)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** 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. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

    Google Scholar 

  2. D.J. Aldous. Reversible Markov chains and random walks on graphs, 1993. Unpublished Monograph, Berkeley.

    Google Scholar 

  3. 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. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 218–223, San Juan, Puerto Rico, October 1979.

    Google Scholar 

  4. G. Barnes and U. Feige. Short random walks. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 728–737, 1993.

    Google Scholar 

  5. A. Borodin. Time-space tradeoffs. In Proceedings of the 4th Annual ISAAC, pages 209–220. Springer-Verlag, 1993.

    Google Scholar 

  6. A.Z. Broder, A.R. Karlin, P. Raghavan, and E. Upfal. Trading space for time in undirected s-t connectivity. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 543–549, Seattle, WA, May 1989. ACM.

    Google Scholar 

  7. T.K. Carne. A transmutation formula for Markov chains. Bull. Sci. Math., 109: 399–405, 1985.

    MathSciNet  MATH  Google Scholar 

  8. A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 574–586, Seattle, May 1989.

    Google Scholar 

  9. D. Coppersmith, U. Feige, and J. Shearer. Random walks on regular and irregular graphs. Technical Report CS93-15, The Weizmann Institute of Science, 1993.

    Google Scholar 

  10. U. Feige. A randomized time-space tradeoff of Õ(m?) for Ustcopn. In 34th Annual IEEE Symposium on Foundations of Computer Science, pages 238–247, 1994.

    Google Scholar 

  11. F. Göbel and A.A. Jagers. Random walks on graphs. Stochastic Processes and their Applications, 2: 311–336, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  12. A. Wigderson. The complexity of graph connectivity. Unpublished manuscript, Computer Science Dept., Hebrew University, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Washington, FR-35, Seattle, WA, 98195, USA

    Anna R. Karlin

  2. IBM T.J.Watson Research Center, Yorktown Heights, NY, 10598, USA

    Prabhakar Raghavan

Authors
  1. Anna R. Karlin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prabhakar Raghavan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Statistics, University of California, Berkeley, CA, 94720, USA

    David Aldous

  2. Department of Mathematics, Harvard University, Cambridge, MA, 02138, USA

    Persi Diaconis

  3. Department of Computer Science Courant Institute, New York University, 251 Mercer Street, New York, NY, 10012, USA

    Joel Spencer

  4. Department of Statistics, The Wharton School University of Pennsylvania, 3000 Steinberg Hall-Dietrich Hall, Philadelphia, PA, 19104-6302, USA

    J. Michael Steele

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media New York

About this paper

Cite this paper

Karlin, A.R., Raghavan, P. (1995). Random Walks and Undirected Graph Connectivity: A Survey. In: Aldous, D., Diaconis, P., Spencer, J., Steele, J.M. (eds) Discrete Probability and Algorithms. The IMA Volumes in Mathematics and its Applications, vol 72. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0801-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0801-3_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-6905-2

  • Online ISBN: 978-1-4612-0801-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation