scientific article; zbMATH DE number 3564005
[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.
- Three problems on the lengths of increasing runs
- Matching rectangles in d-dimensions: Algorithms and laws of large numbers
- An Erdős-Rényi law with shifts
- An extreme value theory for long head runs
- Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence
- Maximal success durations for a semi-Markov process
- On the length of the longest increasing run in \(\mathbb{R}^d\)
- On long runs of heads and tails
- On long runs of heads and tails. II
- Asymptotic expansions for the maximum of random number of random variables
- On asymptotics of the maximal gain without losses.
- On the length of the longest run in a multi-state Markov chain.
- The Hausdorff dimension of level sets described by Erdős-Rényi average
- On the longest gap between power-rate arrivals
- A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis
- Longest runs in coin tossing
- General large deviations of longest gaps in homogeneous Poisson processes
- A general large deviation principle for longest runs
- Quantitative visibility estimates for unrectifiable sets in the plane
- On runs in independent sequences
- On the Erdős-Renyi theorem for random fields and sequences and its relationship with the theory of runs and spacings
- Regularities and irregularities in a random 0,1 sequence
- scientific article; zbMATH DE number 4034737 (Why is no real title available?)
- О длине максимальной серии “успехов” в индивидуальной случайной последовательности
- Long repetitive patterns in random sequences
- On the longest run of coincidences
- scientific article; zbMATH DE number 25571 (Why is no real title available?)
- scientific article; zbMATH DE number 3581344 (Why is no real title available?)
- scientific article; zbMATH DE number 1244320 (Why is no real title available?)
- On the longest runs in Markov chains
- A result on the maximal length of consecutive 0 digits in β-expansions
- On a problem of Tamas Varga
- scientific article; zbMATH DE number 806867 (Why is no real title available?)
- On longest consecutive patterns in Markov chains
- Long hitting times for expanding systems
- Large deviations for the longest gap in Poisson processes
- Predicting long sequences of hits
- Digital search trees and chaos game representation
- Asymptotic independence of 'pure head' stopping times
- Differential privacy in constant function market makers
- Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence
- Oscillation in the initial segment complexity of random reals
- A limit theorem for runs containing two types of contaminations
- On the evolution of random integer compositions
- Time inhomogeneity in longest gap and longest run problems
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)