A sharp estimate for cover times on binary trees

We compute the second order correction for the cover time of the binary tree of depth n by (continuous-time) random walk, and show that with probability approaching 1 as n increases, τcov=|E|[2log2⋅n−logn/2log2+O((loglogn)8)], thus showing that the second order correction differs from the corresponding one for the maximum of the Gaussian free field on the tree.

MoreLess

Year of publication:	2012
Authors:	Ding, Jian ; Zeitouni, Ofer
Published in:	Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 122.2012, 5, p. 2117-2133
Publisher:	Elsevier
Subject:	Cover time \| Random walk \| Gaussian free field

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011064924