Random walks on a finite graph with congestion points

被引：1

作者：

Kang, MH ^{[1
]}

机构：

[1] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2004年 / 153卷 / 02期

关键词：

random walks; hitting times; group representations; congestions; generating functions;

D O I：

10.1016/S0096-3003(03)00660-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 2003 Elsevier Inc. All rights reserved.

引用

页码：601 / 610

页数：10

共 27 条

[1] SHUFFLING CARDS AND STOPPING-TIMES [J].

ALDOUS, D ;

DIACONIS, P .

AMERICAN MATHEMATICAL MONTHLY, 1986, 93 (05) :333-348

[2] HITTING TIMES FOR RANDOM-WALKS ON VERTEX-TRANSITIVE GRAPHS [J].

ALDOUS, D .

MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1989, 106 :179-191

[3]

ALDOUS D, UNPUB MONOGRAPH

[4]

[Anonymous], 1994, GENERATING FUNCTIONO

[5]

BEHRENDS E, 1999, INTRO MARKOV CHAINS

[6]

Bollob┬u├s B., 2013, MODERN GRAPH THEORY, V184

[7]

BUBLEY R, 1997, P 38 IEEE S FDN COMP

[8]

COOPERSMITH D, 1993, J AM MATH SOC, V40, P421

[9]

Diaconis P., 1988, GROUP REPRESENTATION

[10]

Diaconis P., 1991, Ann. Appl. Probab., P36

← 1 2 3 →