Return to Colloquia & Seminar listing
The very hungry caterpillar graph
Probability| Speaker: | Ben Morris, UC Davis |
| Related Webpage: | https://www.math.ucdavis.edu/~morris/ |
| Location: | Zoom lecture |
| Start time: | Wed, Nov 18 2020, 4:10PM |
Consider a random walk on a graph. Let $N_t$ be the number of distinct states visited up to time $t$. It has been conjectured that if $\liminf_{t \to \infty} {N_t \over t} > 0$ then the walk is transient. We construct a counterexample to this.
Joint work with Omer Angel and Ori Gurel-Gurevich.