On a result of aleliunas et al. concerning random walks on graphs

Document Type

Article

Publication Date

1-1-1990

Abstract

Aleliunas et al. [3] proved that for a random walk on a connected graph G = (V,E) on N vertices, the expected minimum number of steps to visit all vertices is bounded by 2|E|(N − 1), regardless of the initial state. We give here a simple proof of that result through an equality involving hitting times of vertices that can be extended to an inequality for hitting times of edges, thus obtaining a bound for the expected minimum number of steps to visit all edges exactly once in each direction. © 1990, Cambridge University Press. All rights reserved.

Identifier

84974061274 (Scopus)

Publication Title

Probability in the Engineering and Informational Sciences

External Full Text Location

https://doi.org/10.1017/S0269964800001789

e-ISSN

14698951

ISSN

02699648

First Page

489

Last Page

492

Issue

4

Volume

4

This document is currently not available here.

Share

COinS