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 |
Fingerprint
Dive into the research topics of 'Linear cover time is exponentially unlikely'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver