2000 character limit reached
The covertime of a biased random walk on $G_{n,p}$
Published 16 Aug 2017 in math.CO, cs.DS, and math.PR | (1708.04908v1)
Abstract: We analyze the covertime of a biased random walk on the random graph $G_{n,p}$. The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.