𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on expected hitting times for a random walk on a connected graph

✍ Scribed by JoséLuis Palacios

Book ID
107826385
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
719 KB
Volume
141
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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