Cover times for words in symmetric and nonsymmetric cases: A comparison
type: Item
instance of: scholarly article
title: Cover times for words in symmetric and nonsymmetric cases: A comparison
zbMATH Open document ID: 0852.60085
DOI: 10.1007/BF02362700
author: T. E. Móri
published in: Journal of Mathematical Sciences (New York)
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 897829
zbMATH Keywords: random letters
zbMATH Keywords: maximum of the waiting times
MaRDI profile type: Publication
cites work: An introduction to covering problems for random walks on graphs
cites work: Threshold limits for cover times
cites work: On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
cites work: Random walks on highly symmetric graphs
cites work: Random walks on \(Z^n_2\)
cites work: A martingale approach to the study of occurrence of sequence patterns in repeated experiments
cites work: Covering problems for Markov chains
cites work: Large deviation results for waiting times in repeated experiments
cites work: Q3808939
cites work: More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run
cites work: On the waiting time till each of some given patterns occurs as a run
cites work: Maximum Waiting Times are Asymptotically Independent
cites work: How homogeneous can the last appearing pattern be?
cites work: Q4850695
cites work: Q4877619
full work available at URL: https://doi.org/10.1007/bf02362700
OpenAlex ID: W2011769127
description: scientific article; zbMATH DE number 897829