Extremal cover times for random walks on trees
From MaRDI portal
Publication:4712121
DOI10.1002/jgt.3190140505zbMath0743.05015OpenAlexW2078711343MaRDI QIDQ4712121
Peter M. Winkler, Graham R. Brightwell
Publication date: 25 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140505
Trees (05C05) Extremal problems in graph theory (05C35) Sums of independent random variables; random walks (60G50) Paths and cycles (05C38)
Related Items
Some further results on the maximal hitting times of trees with some given parameters, The access time of random walks on trees with given partition, Exact mixing times for random walks on trees, The Weighted Coupon Collector’s Problem and Applications, Extremal hitting times of trees with some given parameters, Collecting coupons on trees, and the cover time of random walks, A tight lower bound on the cover time for random walks on graphs, On a cover time problem on a dynamic graph with steps at random times, Hitting times for random walks on tricyclic graphs, Hitting Times, Cover Cost, and the Wiener Index of a Tree, On the (reverse) cover cost of trees with some given parameters, The hitting times of random walks on bicyclic graphs, New Bounds for Edge-Cover by Random Walk, The hitting time of random walk on unicyclic graphs, Random walk covering of some special trees
Cites Work
