1 research outputs found

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

    Get PDF
    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 nlogn\approx n\log n and 32nlogn\approx \frac32n\log n respectively
    corecore