𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating Functions of Waiting Times and Numbers of Visits for Random Walks on Graphs

✍ Scribed by Kiyoshi Inoue, Sigeo Aki…

Book ID
120748456
Publisher
Springer US
Year
2011
Tongue
English
Weight
324 KB
Volume
15
Category
Article
ISSN
1387-5841

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Expected hitting times for random walks
Expected hitting times for random walks on weak products of graphs
✍ Bárbara González-Arévalo; José Luis Palacios 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 89 KB

We study the symmetry properties in weak products of graphs which are inherited from the coordinate graphs and which enable the computation of expected hitting times for a random walk on the product graph. We obtain explicit values for expected hitting times between non-neighboring vertices of the p

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