Bounds on expected hitting times for a random walk on a connected graph

Authors

JoséLuis Palacios, New Jersey Institute of Technology

Document Type

Article

Publication Date

1-1-1990

Abstract

It is known that for a random walk on a connected graph G on N vertices {xl,...,xN} satisfying υ(xi)≤ k for all i [υ(xi) is the valence of xi], the maximum expected number of steps to get from one vertex to another has a bound of order kN(N-1). We give simple sufficient conditions under which, even though υ(xi= O>(N) for all i, the expected hitting times have bounds of orders N, N ^{3 2}, or N ^{5 2}. © 1990.

Identifier

41549166412 (Scopus)

Publication Title

Linear Algebra and Its Applications

External Full Text Location

https://doi.org/10.1016/0024-3795(90)90321-3

ISSN

00243795

First Page

241

Last Page

252

Issue

C

Volume

141

Recommended Citation

Palacios, JoséLuis, "Bounds on expected hitting times for a random walk on a connected graph" (1990). Faculty Publications. 17774.
https://digitalcommons.njit.edu/fac_pubs/17774