Expected cover times of random walks on symmetric graphs

Document Type

Article

Publication Date

7-1-1992

Abstract

We give very simple proofs for an (N-1)HN-1 lower bound and an N2 upper bound for the expected cover time of symmetric graphs. © 1992 Plenum Publishing Corporation.

Identifier

0009986489 (Scopus)

Publication Title

Journal of Theoretical Probability

External Full Text Location

https://doi.org/10.1007/BF01060439

e-ISSN

15729230

ISSN

08949840

First Page

597

Last Page

600

Issue

3

Volume

5

This document is currently not available here.

Share

COinS