✦ LIBER ✦

An introduction to covering problems for random walks on graphs

✍ Scribed by David Aldous

Book ID: 112469770
Publisher: Springer US
Year: 1989
Tongue: English
Weight: 146 KB
Volume: 2
Category: Article
ISSN: 0894-9840
DOI: 10.1007/bf01048271

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

Lower bounds for covering times for reve

Lower bounds for covering times for reversible Markov chains and random walks on graphs

✍ David J. Aldous 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 334 KB

The type-problem on the average for rand

The type-problem on the average for random walks on graphs

✍ R. Burioni; D. Cassi; A. Vezzani 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 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

Random walk on graphs: An application to

Random walk on graphs: An application to the double diffusivity model

✍ A. Kalampakas; E.C. Aifantis 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 205 KB

An introduction to exponential random gr

An introduction to exponential random graph (p*) models for social networks

✍ Garry Robins; Pip Pattison; Yuval Kalish; Dean Lusher 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 363 KB