The hitting and cover times of random walks on finite graphs using local degree information
type: Item
instance of: scholarly article
title: The hitting and cover times of random walks on finite graphs using local degree information
zbMATH Open document ID: 1408.05117
author: Satoshi Ikeda
author: Izumi Kubo
author: Masafumi Yamashita
published in: Theoretical Computer Science
publication date: 2009-02-19T00:00:00Z
Mathematics Subject Classification ID: 05C81
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 5509592
zbMATH Keywords: random walk
zbMATH Keywords: hitting time
zbMATH Keywords: cover time
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.10.020
OpenAlex ID: W1978196657
cites work: On the time taken by random walks on finite groups to visit every state
cites work: Maximum hitting time for random walks on graphs
cites work: The cover time of two classes of random graphs
cites work: Collisions Among Random Walks on a Graph
cites work: A tight upper bound on the cover time for random walks on graphs
cites work: A tight lower bound on the cover time for random walks on graphs
cites work: Q4449241
cites work: On the Cover Time for Random Walks on Random Graphs
cites work: Covering problems for Markov chains
cites work: Q4856179
cites work: On a Result of Aleliunas et al. Concerning Random Walks on Graphs
DOI: 10.1016/J.TCS.2008.10.020
description: scientific article; zbMATH DE number 5509592