Three problems on the lengths of increasing runs

DOI10.1016/0304-4149(83)90054-6zbMath0518.60049OpenAlexW2041752484MaRDI QIDQ1054072

Pál Révész

Publication date: 1983

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(83)90054-6

zbMATH Keywords

law of iterated logarithmlengths of increasings runs

Mathematics Subject Classification ID

Strong limit theorems (60F15) Brownian motion (60J65) Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)

Related Items (10)

Compound Poisson approximation: A user's guide ⋮ Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence ⋮ Strong approximations of renewal processes and their applications ⋮ Longest runs in coin tossing ⋮ The Hausdorff dimension of level sets described by Erdős-Rényi average ⋮ Longest runs in a sequence of \(m\)-dependent random variables ⋮ On the strong law of large numbers for sums over increasing runs ⋮ A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis ⋮ On the length of the longest increasing run in \(\mathbb{R}^d\) ⋮ Strong laws for the maximal gain over increasing runs

Cites Work

• A process of runs and its convergence to the Brownian motion
• Almost sure invariance principles for partial sums of mixing B-valued random variables
• Limiting behavior of a process of runs
• Unnamed Item

This page was built for publication: Three problems on the lengths of increasing runs