A bound for the covering time of random walks on graphs

Document Type

Article

Publication Date

5-4-1992

Abstract

We give bounds for the covering time of a random walk on an undirected connected graph in terms of the diameter of the graph. The bounds are tight in many instances, particularly when the graph is a tree. © 1992.

Identifier

44049119533 (Scopus)

Publication Title

Statistics and Probability Letters

External Full Text Location

https://doi.org/10.1016/0167-7152(92)90204-I

ISSN

01677152

First Page

9

Last Page

11

Issue

1

Volume

14

This document is currently not available here.

Share

COinS