The cover time of a biased random walk on a random cubic graph
Combinatorics
2018-01-04 v2 Data Structures and Algorithms
Abstract
We study a random walk that prefers tou se unvisited edges in the context of random cubic graphs. We establish asymptotically correct estimates for the vertex and edge cover times, these being and respectively.
Cite
@article{arxiv.1801.00760,
title = {The cover time of a biased random walk on a random cubic graph},
author = {Colin Cooper and Alan Frieze and Tony Johansson},
journal= {arXiv preprint arXiv:1801.00760},
year = {2018}
}