✦ LIBER ✦

On the cover time and mixing time of random geometric graphs

✍ Scribed by Chen Avin; Gunes Ercal

Book ID: 108281307
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 693 KB
Volume: 380
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.02.065

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the cover time of random walks on gra

On the cover time of random walks on graphs

✍ Jeff D. Kahn; Nathan Linial; Noam Nisan; Michael E. Saks 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 368 KB

The Cover Time of Random Regular Graphs

✍ Cooper, Colin; Frieze, Alan 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 187 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

Diameter and Broadcast Time of Random Ge

Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions

✍ Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 813 KB

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