Random walks on edge-transitive graphs. II (Q1284583)

[For part I (by the first and second author) see ibid. 37, No. 1, 29-34 (1998; Zbl 0901.60044).] The authors give formulas, in terms of the number of pure \(k\)-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs. They apply these formulas to a class of Cayley graphs and give explicit values for the expected hitting times.