Simple Random Walk (RW) [1]} selects the next-hop node \(v\)  uniformly at random among the neighbors of the current node \(u\) .
In a connected and aperiodic graph, the probability of being at the particular node \(v\)  converges to the stationary distribution
\(\pi ^{\scriptscriptstyle \textrm {RW}}(v)\ =\ \frac{\deg (v)}{2\cdot |E|}.\) 
