A note on the last new vertex visited by a random walk

DOI10.1002/jgt.3190170505zbMath0779.60010OpenAlexW2166488728MaRDI QIDQ4271615

Peter M. Winkler, László Lovász

Publication date: 10 December 1993

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170505

zbMATH Keywords

random walkcover time of a random walk

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Graph theory (05C99)

Related Items (2)

On the Last New Vertex Visited by a Random Walk in a Directed Graph ⋮ The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks

Cites Work

• On a random walk problem arising in self-stabilizing token management

This page was built for publication: A note on the last new vertex visited by a random walk