...transition probabilities P rob(wt = u|wt−1 = v) = 1/dv, provided {u, v} ∈ E, were dv is the number of edgesmeeting at v. G is called recurrent iff a.s. SRW visits any fixed vertex infinitely often. Let G be a graph with...
http://research.microsoft.com/en-us/um/people/origurel/papers/BGG05.pdf