On the length of the longest increasing run in R^d

DOI10.1016/S0167-7152(98)00136-9MaRDI QIDQ1273003zbMATH OpenFDO

Authors Andrey Frolov, A. I. Martikainen

Publication date 2 December 1998

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

Full work available at URL https://doi.org/10.1016/S0167-7152(98)00136-9

zbMATH Keywords

head runincreasing runmonotone blockstrong limit theorems

Mathematics Subject Classification ID

Strong limit theorems (60F15)

Cites work

• scientific article; zbMATH DE number 3564005 (Why is no real title available?)
• scientific article; zbMATH DE number 878347 (Why is no real title available?)
• 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
• Three problems on the lengths of increasing runs

Cited in

(5)

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

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

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