The covertime of a biased random walk on $G_{n,p}$

Alan Frieze; Colin Cooper; Samantha Petti

arxiv: 1708.04908 · v1 · pith:6STHP4YGnew · submitted 2017-08-16 · 🧮 math.CO · cs.DS· math.PR

The covertime of a biased random walk on G_(n,p)

Colin Cooper , Alan Frieze , Samantha Petti This is my paper

classification 🧮 math.CO cs.DSmath.PR

keywords biasedcovertimerandomwalkanalyzecasedegreegraph

0 comments

read the original 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

This paper has not been read by Pith yet.

The covertime of a biased random walk on G_(n,p)

discussion (0)