arXiv Analytics

Sign in

arXiv:1708.04908 [math.CO]AbstractReferencesReviewsResources

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

Colin Cooper, Alan Frieze, Samantha Petti

Published 2017-08-16Version 1

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

Categories: math.CO, cs.DS, math.PR
Related articles: Most relevant | Search more
arXiv:1508.07355 [math.CO] (Published 2015-08-28)
On the trace of random walks on random graphs
arXiv:1412.1004 [math.CO] (Published 2014-12-02)
On rigidity, orientability and cores of random graphs with sliders
arXiv:math/0601659 [math.CO] (Published 2006-01-26)
Positional games on random graphs

Links

Toolbox