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.
Original language | English |
---|---|
Pages (from-to) | 451-461 |
Number of pages | 11 |
Journal | Probability Theory and Related Fields |
Volume | 155 |
Issue number | 1-2 |
DOIs | |
State | Published - Feb 2013 |
Externally published | Yes |