✳flâneur — a map of the web's best reading

Cover times - spectral

arxiv.org · 154 words · saved by 1 readers

N/A

Cover times, blanket times, and majorizing measures 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 a

Explore this link on the map →

saved by

related reading