| Random Walks on Directed Graph |
| Received:February 01, 2001 |
| Key Words:
probability Markov chain graph random walk.
|
| Fund Project: |
|
| Hits: 2246 |
| Download times: 1378 |
| Abstract: |
| A random walk on a digraph is defined in which a particle moves from one vertex to any successor of this vertex with equal probability. Detailed results are given on the expectation of first passage time and the expected number of times to be in some vertex during the first n steps. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2003.04.028 |
| View Full Text View/Add Comment |
