Bounds on the cover time
type: Item
instance of: scholarly article
title: Bounds on the cover time
zbMATH Open document ID: 0681.60063
DOI: 10.1007/BF01048273
author: Andrei Broder
author: Anna R. Karlin
published in: Journal of Theoretical Probability
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 4115668
zbMATH Keywords: random walks on graphs
zbMATH Keywords: cover times
zbMATH Keywords: eigenvalues of transition
zbMATH Keywords: matrix
zbMATH Keywords: upper and lower bounds
MaRDI profile type: Publication
cites work: Eigenvalues and expanders
cites work: On the time taken by random walks on finite groups to visit every state
cites work: Minimization algorithms and random walk on the d-cube
cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs
cites work: Approximate counting, uniform generation and rapidly mixing Markov chains
cites work: On the cover time of random walks on graphs
cites work: Bounds for eigenvalues of certain stochastic matrices
cites work: Inequalities: theory of majorization and its applications
cites work: Some Extremal Markov Chains
Recommended article: Deterministic approximation of the cover time
Recommended article: A Technique for Lower Bounding the Cover Time
Recommended article: Improved approximation of the minimum cover time
Recommended article: A bound for the covering time of random walks on graphs
Recommended article: Cover times, blanket times, and majorizing measures
Recommended article: Cover Times and Generic Chaining
Recommended article: Bounds for optimal coverings
description: scientific article; zbMATH DE number 4115668