Linear cover time is exponentially unlikely

Research output: Contribution to journalArticlepeer-review


We show that the probability that a simple random walk covers a finite, bounded degree graph in linear time is exponentially small. We conjecture that the same holds for any simple graph.
Original languageEnglish
Pages (from-to)451-461
Number of pages11
JournalProbability Theory and Related Fields
Issue number2-Jan
StatePublished - Feb 2013

All Science Journal Classification (ASJC) codes

  • Analysis
  • Statistics and Probability
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Linear cover time is exponentially unlikely'. Together they form a unique fingerprint.

Cite this