Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence
- 1 May 1987
- journal article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 75 (1) , 77-85
- https://doi.org/10.1007/bf00320082
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Three problems on the lengths of increasing runsStochastic Processes and their Applications, 1983
- On the Length of the Longest Head-Run for a Markov Chain with Two StatesTheory of Probability and Its Applications, 1982
- Long repetitive patterns in random sequencesProbability Theory and Related Fields, 1980
- On a new law of large numbersJournal d'Analyse Mathématique, 1970
- The central limit problem for mixing sequences of random variablesProbability Theory and Related Fields, 1969