The covertime of a biased random walk on $G_{n,p}$
Combinatorics
2017-08-17 v1 Data Structures and Algorithms
Probability
Abstract
We analyze the covertime of a biased random walk on the random graph . The walk is biased towards visiting vertices of low degree and this makes the covertime less than in the unbiased case
Cite
@article{arxiv.1708.04908,
title = {The covertime of a biased random walk on $G_{n,p}$},
author = {Colin Cooper and Alan Frieze and Samantha Petti},
journal= {arXiv preprint arXiv:1708.04908},
year = {2017}
}