
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
The cover time, the blanket time, and the Matthews bound
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
J. Kahn, J.H. Kim, L. Lovasz, V.H. Vu, "The cover time, the blanket time, and the Matthews bound," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 467, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892134, author = {J. Kahn and J.H. Kim and L. Lovasz and V.H. Vu}, title = {The cover time, the blanket time, and the Matthews bound}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {467}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892134}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  The cover time, the blanket time, and the Matthews bound SN  02725428 SP EP A1  J. Kahn, A1  J.H. Kim, A1  L. Lovasz, A1  V.H. Vu, PY  2000 KW  graph theory; computational complexity; theorem proving; approximation theory; deterministic algorithms; cover time; blanket time; Matthews bound; random walk; Matthews bounds; deterministicpolynomial time algorithm; stationary distribution; approximation algorithm; graph VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
We prove upper and lower bounds and give an approximation algorithm for the cover time of the random walk on a graph. We introduce a parameter M motivated by the wellknown Matthews bounds (P. Matthews, 1988) on the cover time, C, and prove that M/2>C= O(M(lnlnn)/sup 2/). We give a deterministicpolynomial time algorithm to approximate M within a factor of 2; this then approximates C within a factor of O((lnlnn)/sup 2/), improving the previous bound O(lnn) due to Matthews. The blanket time B was introduced by P. Winkler and D. Zuckerman (1996): it is the expectation of the first time when all vertices are visited within a constant factor of the number of times suggested by the stationary distribution. Obviously C/spl les/B. Winkler and Zuckerman conjectured B=O(C) and proved B=O(Clnn). Our bounds above are also valid for the blanket time, and so it follows that B=O(C(lnlnn)/sup 2/).
Index Terms:
graph theory; computational complexity; theorem proving; approximation theory; deterministic algorithms; cover time; blanket time; Matthews bound; random walk; Matthews bounds; deterministicpolynomial time algorithm; stationary distribution; approximation algorithm; graph
Citation:
J. Kahn, J.H. Kim, L. Lovasz, V.H. Vu, "The cover time, the blanket time, and the Matthews bound," focs, pp.467, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.