The generating functions of hitting times for random walk on trees

Statistics and Probability Letters

Volumn 77, Issue 15, 2007, Pages 1574-1579

  Chen, Haiyan ^a  

^a JIMEI UNIVERSITY   (China)

Author keywords

Cover times; Hitting times; Probability generating function; Random walks; Trees

Indexed keywords

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

References (7)

1. Aldous, D., Fill, J., 2002. Reversible Markov Chains and Random Walks on Graphs. 〈http://www.stat.Berkely.edu/users/book.html〉.
2. Bollobás B. Modern Graph Theory (1998), Springer, New York
3. Chen H.Y., and Zhang F.J. The expected hitting times for graphs with cutpoints. Statist. Probab. Lett. 66 (2004) 9-17
4. Doyle P.G., and Snell J.L. Random Walks and Electrical Networks (1984), The Mathematical Association of America, Washington, DC
5. Kemeny J.G., and Snell J.L. Finite Markov Chains (1983), Springer, New York
6. Matthews P.C. Covering problems for Markov chains. Ann. Probab. 16 (1988) 1215-1228
7. Syski R. Passage Times for Markov Chains (1992), IOS Press, Amsterdam