The covertime of a biased random walk on Gn,p
Abstract
We analyze the covertime of a biased random walk on the random graph Gn,p. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.