The expected hitting times for graphs with cutpoints

Statistics and Probability Letters

Volumn 66, Issue 1, 2004, Pages 9-17

  Haiyan, Chen ^a   Fuji, Zhang ^a  

^a XIAMEN UNIVERSITY   (China)

Author keywords

Effective resistance; Random walks; The expected hitting time

Indexed keywords

EID: 0345058988     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.spl.2003.08.012     Document Type: Article

References (11)

1. Aldous D. Hitting times for random walks on vertex-transitive graphs Math. Proc. Cambridge Phil. Soc. 106 1989 179-191
2. Biggs N.L. 1993 Potential theory on distance-regular graphs. Cambridge Conference in Honour of Paul Erdos.
3. Bollobás B. Modern Graph Theory 1998 Springer New York
4. Devroye L. Sbihi A. Random walks on highly symmetric graphs J. Theoret. Probab. 4 1990 497-514
5. Doyle P.G. Snell J.L. Random Walks and Electrical Networks 1984 The Mathematical Association of America Washington, DC
6. Kirkland S.J. Neumann M. Cutpoint decoupling and first passage times for random walks on graphs SIAM J. Matrix Anal. Appl. 20 4 1999 860-870
7. Palacios J.L. Renom J.M. Random walks on edge transitive graphs Statist. Probab. Lett. 37 1998 29-34
8. Palacios J.L. TeTali P. A note on expected hitting times for birth and death chains Statist. Probab. Lett. 30 1996 119-125
9. Palacios J.L. Renom J.M. Berrizbeitia P. Random walks on edge transitive graphs (II) Statist. Probab. Lett. 43 1999 25-32
10. TeTali P. Random walks and the effective resistance of networks J. Theoret. Probab. 4 1991 101-109
11. Van Slijpe A.R.D. Random walks on the triangular prism and other vertex transitive graphs J. Comput. Appl. Math. 15 1986 383-394