Random walks on edge-transitive graphs (II)

Statistics and Probability Letters

Volumn 43, Issue 1, 1999, Pages 25-32

  Palacios, José Luis ^a   Renom, José Miguel ^b   Berrizbeitia, Pedro ^a  

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

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cayley graphs; Edge transitive graphs; Hitting times

Indexed keywords

EID: 0041876527     PISSN: 01677152     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-7152(98)00241-7     Document Type: Article

References (6)

1. Berrizbeitia P., Giudici R.E. Counting pure. k -cycles in sequences of Cayley graphs Discrete Math. 149:1996;11-18.
2. Biggs, N.L., 1993. Potential theory on distance-regular graphs. Cambridge conference in honour of Paul Erdös.
3. Buckley, F., Harary, F., 1990. Distance in graphs. Addison-Wesley, New York.
4. Bouwer I.Z. Vertex and edge transitive, but not 1-transitive, graphs. Can. Math. Bull. 13:1970;231-237.
5. Devroye L., Sbihi A. Random walks on highly symmetric graphs. J. Theoret. Probab. 4:1990;497-514.
6. Palacios J.L., Renom J.M. Random walks on edge transitive graphs. Statist. Probab. Lett. 37:1998;29-34.