A sharp estimate for cover times on binary trees (Q424523): Difference between revisions

The paper deals with a cover time of a random walk on a graph. The cover time of a random walk on a graph, which is the time it takes the walk to visit every vertex in the graph is a basic parameter. The authors compute the second order correction for cover time of the binary tre of depth \(n\) (continuous time) random walk and show that the second order correction differs from corresponding one for the maximum of the Gaussian free field on the tree.