Random walks on finite graphs with congestion points
By Mihyun KangApplied Mathematics and Computation, 153 (2004), 601-610
Abstract
We consider a random walk on a finite graph with congestion points, which can be decomposed into finite groups. We derive the explicit formulas of the probability generating function of the first hitting time using group representations.
Download
- ps.gz - randomwalk.ps.gz
