𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Commute times of random walks on trees

✍ Scribed by Konsowa, Mokhtar; Al-Awadhi, Fahimah; Telcs, András

Book ID
122565393
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
215 KB
Volume
161
Category
Article
ISSN
0166-218X

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

Random walks on trees
Random walks on trees
✍ Lynn Hauser Pearce 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 267 KB

The classical gambler's ruin problem, i.e., a random walk along a line may be viewed q raph theoretically as a random walk along a path with the endpoints as absorbing states. This paper is an i0vestigation of the natural generalization of this problem to that of a particle walking randomly on a tre

Branching random walks on trees
Branching random walks on trees
✍ Neal Madras; Rinaldo Schinazi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 757 KB
Simple Random Walks on Trees
Simple Random Walks on Trees
✍ Gerl, Peter; Woess, Wolfgang 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 485 KB