Cover times, blanket times, and majorizing measures
From MaRDI portal
Publication:5419075
DOI10.1145/1993636.1993646zbMath1288.05252MaRDI QIDQ5419075
Jian Ding, Yuval Peres, James R. Lee
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993646
60G15: Gaussian processes
05C80: Random graphs (graph-theoretic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
05C81: Random walks on graphs
Related Items
A Spectral Approach to Network Design, Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving, On Sidorenko's conjecture for determinants and Gaussian Markov random fields, On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems, A sharp estimate for cover times on binary trees, Derandomizing random walks in undirected graphs using locally fair exploration strategies