Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence

DOI10.1007/BF00320082zbMath0595.60034MaRDI QIDQ1077809

Karl Grill

Publication date: 1987

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

zbMATH Keywords

stationary mixing sequencesalmost sure asymptotic behaviour of the length of the longest runcoin-tossing sequenceErdős-Révész type boundslength of a run

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Strong limit theorems (60F15)

Related Items (3)

On the length of the longest run in a multi-state Markov chain. ⋮ Rate of convergence in the problem of the longest head-run ⋮ Longest runs in a sequence of \(m\)-dependent random variables

Cites Work

• Three problems on the lengths of increasing runs
• On a new law of large numbers
• Long repetitive patterns in random sequences
• On the Length of the Longest Head-Run for a Markov Chain with Two States
• The central limit problem for mixing sequences of random variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence