Linear cover time is exponentially unlikely

Abstract

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. © 2011 Springer-Verlag.