Cover times, blanket times, and majorizing measures

Details Cover times, blanket times, and majorizing measures Cover times, blanket times, and majorizing measures

2010-04-25

arxiv.org/abs/1004.4371v5

Mathematics

Probability

Revisions to Section 3; added and rearranged some material on the majorizing measures theory

Scientific paper

We exhibit a strong connection between cover times of graphs, Gaussian processes, and Talagrand's theory of majorizing measures. In particular, we show that the cover time of any graph $G$ is equivalent, up to universal constants, to the square of the expected maximum of the Gaussian free field on $G$, scaled by the number of edges in $G$. This allows us to resolve a number of open questions. We give a deterministic polynomial-time algorithm that computes the cover time to within an O(1) factor for any graph, answering a question of Aldous and Fill (1994). We also positively resolve the blanket time conjectures of Winkler and Zuckerman (1996), showing that for any graph, the blanket and cover times are within an O(1) factor. The best previous approximation factor for both these problems was $O((\log \log n)^2)$ for $n$-vertex graphs, due to Kahn, Kim, Lovasz, and Vu (2000).

Affiliated with

Also associated with

No associations

Rating

Cover times, blanket times, and majorizing measures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cover times, blanket times, and majorizing measures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cover times, blanket times, and majorizing measures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-186601