Extremal cover times for random walks on trees


Let CJT) denote the "cover time" of the tree Tfrom the vertex u, that is, the expected number of steps before a random walk starting at u hits every vertex of T: Asymptotic lower bounds for CJT) (for T a tree on n vertices) have been obtained recently by Kahn, Linial, Nisan and Saks, and by Devroye and Sbihi; here, we obtain the exact lower bound… (More)
DOI: 10.1002/jgt.3190140505


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics