On the Last New Vertex Visited by a Random Walk in a Directed Graph

Calum Buchanan, Paul Horn, Puck Rombach

Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with equal probability to any neighbor of its current vertex, and ends when it has vi…