Cover times for words in symmetric and nonsymmetric cases: A comparison
From MaRDI portal
Publication:1917614
DOI10.1007/BF02362700zbMath0852.60085MaRDI QIDQ1917614
Publication date: 7 July 1996
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Cites Work
- Covering problems for Markov chains
- Random walks on highly symmetric graphs
- Large deviation results for waiting times in repeated experiments
- On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
- Random walks on \(Z^n_2\)
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- On the waiting time till each of some given patterns occurs as a run
- An introduction to covering problems for random walks on graphs
- Threshold limits for cover times
- How homogeneous can the last appearing pattern be?
- Maximum Waiting Times are Asymptotically Independent
- More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run
- Unnamed Item
- Unnamed Item
- Unnamed Item