Exact computation for the cover times of certain classes of trees

MaRDI QIDQ3067597zbMATH OpenFDO

Authors Yusuke Higuchi, Takuya Ohwa, Tomoyuki Shirai

Publication date 21 January 2011

Full work available at URL http://gcoe-mi.jp/english/./temp/publish/914ca34dcb22f6c35b44670a61389a65.pdf

zbMATH Keywords

treefirst hitting timecover timesubdivisionspider graphterminal time

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Extremal cover times for random walks on trees
• Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
• Random walk covering of some special trees
• On the cover time of random walks on graphs
• A sharp estimate for cover times on binary trees

Cited in

(2)

• A scaling limit for the cover time of the binary tree
• scientific article; zbMATH DE number 6292624 (Why is no real title available?)

This page was built for publication: Exact computation for the cover times of certain classes of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067597)