|
|
 |
| |
|
|
|
Simple random walks on wheel graphs |
|
|
|
PP: 123S-128S |
|
|
|
Author(s) |
|
|
|
Yujun Yang,
|
|
|
|
Abstract |
|
|
| A simple random walk on a graph is defined in which a particle moves from one vertex to any
adjacent vertex, each with equal probability. The expected hitting time is the expected number of steps
to get from one vertex to another before returning to the starting vertex. In this paper, using the electrical
network approach, we provide explicit formulae for expected hitting times for simple random walks on
wheel graphs. As a by-product, formulae for expected commute times and expected difference times,
and bounds for the expected cover times for simple random walks on wheel graphs are obtained. |
|
|
|
|
|
|
|
