Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time
Let be a connected graph with vertices. A simple random walk on the vertex set of G is a process, which at each step moves from its current vertex position to a neighbouring vertex chosen uniformly at random.
random walk cover time random graph rotor-router model