We analyze the covertime of a biased random walk on the random graph $G_{n,p}$. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case
Retrieving citation...