Bounds on expected hitting times for a random walk on a connected graph
type: Item
instance of: scholarly article
title: Bounds on expected hitting times for a random walk on a connected graph
zbMATH Open document ID: 0711.05040
DOI: 10.1016/0024-3795(90)90321-3
author: José Luis Palacios
published in: Linear Algebra and its Applications
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 60G50
zbMATH DE Number: 4168721
zbMATH Keywords: random walk
zbMATH Keywords: connected graph
zbMATH Keywords: maximum expected number of steps to get from one vertex to another
zbMATH Keywords: expected hitting times
MaRDI profile type: Publication
full work available at URL: 0024-3795(90)90321-3
OpenAlex ID: W2071531804
cites work: Q3849175
cites work: Q3254327
cites work: Bounds on the spectral radius of graphs with e edges
cites work: Expected hitting times for a random walk on a connected graph
cites work: Non-negative matrices and Markov chains. 2nd ed
cites work: A bound on the spectral radius of graphs
description: scientific article; zbMATH DE number 4168721