✦ LIBER ✦

Exact Mixing Times for Random Walks on Trees

✍ Scribed by Andrew Beveridge, Meng Wang

Book ID: 120788718
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 246 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1175-x

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

Commute times of random walks on trees

✍ Konsowa, Mokhtar; Al-Awadhi, Fahimah; Telcs, András 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 215 KB

On hitting times of random walks on tree

On hitting times of random walks on trees

✍ José Luis Palacios 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 267 KB

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

Centers for Random Walks on Trees

✍ Beveridge, Andrew 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 272 KB

Branching random walks on trees

✍ Neal Madras; Rinaldo Schinazi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 757 KB