scientific article; zbMATH DE number 3564005

From MaRDI portal
Publication:4136276





[For the entire collection see Zbl 0349.00030.] Let \(X_1,X_2,\dots\) be a sequence of i.i.d.r.v.'s with \(P(X_1=0)=P(X_1=1)=1/2\), further put \(S_n=X_1+X_2+\dots+X_n, I(N,k)=\max_{0\leq i\leq N-k}(S_{i+k}-S_i)\) and let \(Z_N\) be the largest integer for which \(I(N,Z_N)=Z_N\) that is \(Z_N\) is the length of the longest head run. The main result says: for any \(\varepsilon> 0\) there exists a r.v. \(N_0=N_0(\varepsilon,\omega)\) such that \(Z_N\geq[\log N-\log \log \log N+\log \log e-2-\varepsilon]\) for all \(N\geq N_0\) but for any \(\varepsilon> 0\) there exists a sequence \(N_1=N_1(\omega ,\varepsilon)< N_2=N_2(\omega,\varepsilon)< \dots\) such that \(Z_{N_i}\leq[\log N_i-\log \log \log N_i+\log \log e-1+\varepsilon]\) (i = 1,2,...). The base of the log is 2.




Cited in
(45)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136276)