𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic results on occupancy times of random walks

✍ Scribed by K. P. N. Murthy; M. C. Valsakumar

Publisher
Springer
Year
1982
Tongue
English
Weight
251 KB
Volume
29
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal cover times for random walks on
Extremal cover times for random walks on trees
✍ Graham Brightwell; Peter Winkler πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 370 KB

## Abstract Let __C~Ξ½~__(__T__) denote the β€œcover time” of the tree __T__ from the vertex __v__, that is, the expected number of steps before a random walk starting at __v__ hits every vertex of __T.__ Asymptotic lower bounds for __C~Ξ½~__(__T__) (for __T__ a tree on __n__ vertices) have been obtain