Random Walks on Directed Graph

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.