✦ LIBER ✦

The hitting and cover times of random walks on finite graphs using local degree information

✍ Scribed by Satoshi Ikeda; Izumi Kubo; Masafumi Yamashita

Book ID: 108281498
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 507 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.10.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering times of random walks on bounde

Covering times of random walks on bounded degree trees and other graphs

✍ David Zuckerman 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 422 KB

On the Mean and Variance of Cover Times

On the Mean and Variance of Cover Times for Random Walks on Graphs

✍ Frank Ball; Bruce Dunham; A Hirschowitz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 141 KB

A method is described for calculating the mean cover time for a particle performing a simple random walk on the vertices of a finite connected graph. The method also yields the variance and generating function of the cover time. A computer program is available which utilises the approach to provide