The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree
The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree
We consider a random walk process on graphs introduced by Orenshtein and Shinkar (2014). At any time, the random walk moves from its current position along a previously unvisited edge chosen uniformly at random, if such an edge exists. Otherwise, it walks along a previously visited edge chosen uniformly at …