✦ LIBER ✦

On the cover time of random walks on graphs

✍ Scribed by Jeff D. Kahn; Nathan Linial; Noam Nisan; Michael E. Saks

Book ID: 112469773
Publisher: Springer US
Year: 1989
Tongue: English
Weight: 368 KB
Volume: 2
Category: Article
ISSN: 0894-9840
DOI: 10.1007/bf01048274

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bound for the covering time of random

A bound for the covering time of random walks on graphs

✍ JoséLuis Palacios 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 199 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

The hitting and cover times of random wa

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

✍ Satoshi Ikeda; Izumi Kubo; Masafumi Yamashita 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Expected cover times of random walks on

Expected cover times of random walks on symmetric graphs

✍ José Luis Palacios 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 203 KB

Random Walks on Directed Covers of Graph

Random Walks on Directed Covers of Graphs

✍ Lorenz A. Gilch; Sebastian Müller 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 684 KB

Random walks on random simple graphs

✍ Martin Hildebrand 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 676 KB

This paper looks at random regular simple graphs and considers nearest neighbor random walks on such graphs. This paper considers walks where the degree d of each vertex is around (logn)", where a is a constant which is at least 2 and where n is the number of vertices. By extending techniques of Dou