Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation Algorithms for Combinatorial Optimization

International Workshop on Randomization and Approximation Techniques in Computer Science

APPROX 2007, RANDOM 2007: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques pp 422–435Cite as

The Cover Time of Random Digraphs

  • Conference paper

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

Abstract

We study the cover time of a random walk on the random digraph D n,p when \(p=\frac{d\log n}{n}, d>1\). We prove that whp the cover time is asymptotic to .

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs, http://stat-www.berkeley.edu/pub/users/aldous/RWG/book.html

  2. 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. IEEE Computer Society Press, Los Alamitos (1979)

    Google Scholar 

  3. Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley-Interscience, Chichester (2000)

    Book  MATH  Google Scholar 

  4. Cooper, C., Frieze, A.M.: The cover time of sparse random graphs. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 140–147 (2003)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Cooper, C., Frieze, A.M.: The cover time of the preferential attachment graph. Journal of Combinatorial Theory Series B (to appear)

    Google Scholar 

  7. Cooper, C., Frieze, A.M.: The cover time of the giant component of a random graph

    Google Scholar 

  8. Feige, U.: A tight upper bound for the cover time of random walks on graphs. Random Structures and Algorithms 6, 51–54 (1995)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58, 13–30 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kim, J.H., Vu, V.: Concentration of multivariate polynomials and its applications. Combinatorica 20, 417–434 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, King’s College, University of London, London WC2R 2LS, UK

    Colin Cooper

  2. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA15213, USA

    Alan Frieze

Authors
  1. Colin Cooper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Frieze
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Dept., Princeton University, 35 Olden Street, NJ 08540-5233, Princeton, USA

    Moses Charikar

  2. Institut für Informatik, Christian-Albrechts-Universität zu Kiel,, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

  3. Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, 76100, Rehovot, Israel

    Omer Reingold

  4. Centre Universitaire d’Informatique,, Battelle bâtiment A, route de Drize 7, 1227, Geneva, Carouge, Switzerland

    José D. P. Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cooper, C., Frieze, A. (2007). The Cover Time of Random Digraphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2007 2007. Lecture Notes in Computer Science, vol 4627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74208-1_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74208-1_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74207-4

  • Online ISBN: 978-3-540-74208-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation