Last-Coverage Probabilities of Random Walks on Cycle Graphs for Symmetric, Biased, and Time-Dependent Walks

Kiyan Idnani, Jad Salem

This paper studies the last-coverage vertex of a nearest-neighbour random walk on a cycle: the vertex most likely to be the final one discovered. We show that the visited vertices…