𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inverse problems for random walks on trees: Network tomography

✍ Scribed by Victor de la Pena; Henryk Gzyl; Patrick McDonald

Book ID
108267559
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
567 KB
Volume
78
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Centers for Random Walks on Trees
Centers for Random Walks on Trees
✍ Beveridge, Andrew πŸ“‚ Article πŸ“… 2009 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 272 KB
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