A bound for the covering time of random walks on graphs

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.

MoreLess

Year of publication:	1992
Authors:	Palacios, JoséLuis
Published in:	Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 14.1992, 1, p. 9-11
Publisher:	Elsevier
Subject:	Covering time graph diameter

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005074692