The cover time of a biased random walk on a random cubic graph

01/02/2018

∙

by   Colin Cooper, et al.

∙

0

∙

share

We study a random walk that preferes touse unvisited edges in the context of random cubic graphs. We establish asymptotically correct estimates for the vertex and edge covertimes, these being ≈ n n and ≈3/2n n respectively.