Random walks on a finite graph with congestion points

作者:

Highlights:

摘要

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.

论文关键词:Random walks,Hitting times,Group representations,Congestions,Generating functions

论文评审过程:Available online 12 July 2003.

论文官网地址:https://doi.org/10.1016/S0096-3003(03)00660-X