On the length of the longest increasing run in \(\mathbb{R}^d\)

DOI10.1016/S0167-7152(98)00136-9zbMath0916.60031MaRDI QIDQ1273003

Andrei N. Frolov, Alexander I. Martikainen

Publication date: 2 December 1998

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

strong limit theoremshead runincreasing runmonotone block

Mathematics Subject Classification ID

Strong limit theorems (60F15)

Related Items (5)

The Hausdorff dimension of level sets described by Erdős-Rényi average ⋮ On asymptotics of the maximal gain without losses. ⋮ Ascending runs in dependent uniformly distributed random variables: application to wireless networks ⋮ A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis ⋮ Strong laws for the maximal gain over increasing runs

Cites Work

• Unnamed Item
• Unnamed Item
• Three problems on the lengths of increasing runs
• Limiting behavior of a process of runs
• Longest runs in a sequence of \(m\)-dependent random variables
• On the Erdös-Rényi theorem for random fields and sequences and its relationships with the theory of runs and spacings

This page was built for publication: On the length of the longest increasing run in \(\mathbb{R}^d\)