Expected hitting times for a random walk
✍
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