by randomly selecting a neighbor \(v\)  of the current node \(u\)  and moving there with probability \(\min (1,\frac{\deg (u)}{\deg (v)})\) .
However, it was shown in [1]}, [2]} that RW (after re-weighting, as in Section REF ) outperforms MHRW for most applications. We therefore restrict our attention to comparing against RW.
