文章基本信息
- 标题：Linear cover time for trees is exponentially unlikely
- 本地全文：下载
- 作者：Amir Yehudayoff.
- 期刊名称：Chicago Journal of Theoretical Computer Science
- 印刷版ISSN：1073-0486
- 出版年度：2012
- 卷号：2012
- 出版社：MIT Press ; University of Chicago, Department of Computer Science
- 摘要：
The cover time of a graph is the time it takes for a random walk on it to visit all vertices. This note shows that for any tree on n vertices, the probability that the cover time of the tree is linear in n is exponentially small in n. This is true for any starting vertex.
