Linear cover time is exponentially unlikely

Itai Benjamini, Ori Gurel-Gurevich*, Ben Morris

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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 languageAmerican English
Pages (from-to)451-461
Number of pages11
JournalProbability Theory and Related Fields
Issue number1-2
StatePublished - Feb 2013
Externally publishedYes


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

Cite this