𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs

✍ Scribed by Cogill, Randy; Peng, Cheng

Book ID
118197080
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
270 KB
Volume
24
Category
Article
ISSN
0895-4801

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

Expected hitting times for a random walk
Expected hitting times for a random walk on a connected graph
✍ Gregory F Lawler πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 297 KB

A random walk on a graph is defined in which a particle moves from one vertex to any adjoining vertex, each with equal probability. The expected number of steps to get from one point to another is considered. It is shown that the maximum expectation for a graph with N vertices is O(N3). It is also s