You need to know: Graph, finite graph, connected graph, notation for graph with vertex set V and edge set E, notation
for the number of edges in G, degree
of vertex
, probability, selection uniformly at random, expectation,
notation.
Background: Let be a connected graph. A simple random walk on G is the process which starts at some vertex v at time
, and then at times
moves to an adjacent vertex selected uniformly at random. Let
be the first time at which every vertex of G has been visited, and let
be the expectation of
(which depend on the initial vertex v). Number
is called the cover time of G.
For any , let
be a (random) number of times the random walk has visited v up to time t. For
, let
be the first time
at which
holds for all
. Number
is called the
–blanket time of G.
The Theorem: On 25th April 2010, Jian Ding, James Lee, and Yuval Peres submitted to arxiv a paper in which they proved that for every , there exists a
such that for every connected graph G, one has
.
Short context: It is known that as , the proportion of time a random walk spend at any vertex v converges to
. Hence,
is the first time at which all nodes have been visited at least a
fraction as much as we expect. Because
by definition, the Theorem states that the blanket and cover times are within an O(1) factor. It confirms conjecture of Winkler and Zuckerman made in 1996.
Links: Free arxiv version of the original paper is here, journal version is here.