Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence (Q1077809)

Let \(\{X_ n\}\) be a sequence of random variables assuming only values 0 and 1. A run of ones is a sequence of ones not interrupted by zeroes and preceded and followed by zeroes (except at the boundaries of the original sequence). The length of a run and the longest run within the first n observations are defined in the natural way. \textit{P. Erdős} and \textit{P. Révész} [Top. Inf. Theory, Keszthely 1975, Colloq. Math. Soc. János Bolyai 16, 219-228 (1977; Zbl 0362.60044), cf. also \textit{S. S. Samarova}, Teor. Veroyatn. Primen. 26, 510-520 (1981; Zbl 0466.60065); English translation in Theory Probab. Appl. 26, 498-509 (1981) and \textit{L. J. Guibas} and \textit{A. M. Odlyzko}, Z. Wahrscheinlichkeitstheor. Verw. Geb. 53, 231-240 (1980; Zbl 0424.60036)] gave a description of the almost sure asymptotic behaviour of the length of the longest run of ones from a coin-tossing sequence (i.e., the \(X_ n\) are i.i.d. r.v. with \(P(X_ n=0)=P(X_ n=1)=1/2)\). The present paper aims to extend their result to a certain class of stationary mixing sequences.