Random walks on edge transitive graphs

Statistics and Probability Letters

Volumn 37, Issue 1, 1998, Pages 29-34

  Palacios, José Luis ^a   Renom, José Miguel ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

Cover times; Edge transitive graphs; Effective resistance

Indexed keywords

EID: 0032518003     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-7152(97)00095-3     Document Type: Article

References (17)

1. Aldous, D., 1989. Hitting times for random walks on vertex-transitive graphs. Math. Proc. Cambridge Phil. Soc. 106, 179-191.
2. Aldous, D., Fill, J., 1996. Reversible Markov chains and random walks on graphs. Book draft.
3. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C., 1979. Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science. Association for Computing Machinery, San Juan. PR, pp. 218-223.
4. Bouwer, I.Z., 1970. Vertex and edge transitive, but not 1-transitive, graphs. Can. Math. Bull. 13, 231-237.
5. Buckley, F., Harary, F., 1990. Distance in Graphs. Addison-Wesley, New York.
6. Devroye, L., Sbihi, A., 1990. Random walks on highly symmetric graphs. J. Theoret. Probab. 4, 497-514.
7. Doyle, P.G., Snell, J.L., 1984. Random Walks and Electric Networks. The Mathematical Association of America, Washington, DC.
8. Feige. U., 1995. A tight upper bound on the cover time for random walks on graphs. Ran. Str. Algorithms 6, 51-54.
9. Folkman, J., 1967. Regular line-symmetric graphs. J. Combin. Theory 3, 215-232.
10. Göbel, F., Jagers, A.A., 1974. Random walks on graphs. Stoch. Proc. Appl. Sci. Eng. 2, 311-336.
11. Kahn, J.D., Linial, N., Nisan, N., Saks, M.E., 1989. On the cover time of random walks on graphs. J. Theoret. Probab. 2, 121-128.
12. Matthews, P., 1988. Covering problems for Markov chains. Ann. Probab. 16, 1215-1228.
13. Palacios, J.L., 1990. On a result of Aleliunas et al. concerning random walks on graphs. Probab. Eng. Inform. Sci. 4, 489-492.
14. Palacios, J.L., 1992. Expected cover times of random walks on symmetric graphs. J. Theoret. Probab. 5, 597-600.
15. Renom, J.M., 1996. Tiempos esperados de llegada de paseos aleatorios en grafos altamente simétricos. Master's Thesis, Universidad Simon Bolivar, Caracas.
16. Tetali, P., 1991. Random walks and the effective resistance of networks. J. Theoret. Probab. 4, 101-109.
17. Van Slijpe, A.R.D., 1986. Random walks on the triangular prism and other vertex transitive graphs. J. Comp. Appl. Math. 15, 383-394.