Short Random Walks on Graphs

Abstract

The short-term behavior of random walks on graphs is studied, in particular, the rate at which a random walk discovers new vertices and edges. A conjecture by Linial that the expected time to find $\mathcal{N}$ distinct vertices is $O(\mathcal{N}^3 )$ is proved. In addition, upper bounds of $O(\mathcal{M}^2 )$ on the expected time to traverse $\mathcal{M}$ edges and of $O(\mathcal{M}\mathcal{N})$ on the expected time to either visit $\mathcal{N}$ vertices or traverse $\mathcal{M}$ edges (whichever comes first) are proved.