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

DOI10.1007/BF00320082MaRDI QIDQ1077809zbMATH OpenFDO

Authors Karl Grill

Publication date 1987

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

zbMATH Keywords

stationary mixing sequencesalmost sure asymptotic behaviour of the length of the longest runcoin-tossing sequencelength of a runErdős-Révész type bounds

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3581344
• scientific article; zbMATH DE number 3564005
• Regularities and irregularities in a random 0,1 sequence
• Longest runs in a sequence of \(m\)-dependent random variables
• On runs in independent sequences

Cites work

• scientific article; zbMATH DE number 3915300 (Why is no real title available?)
• scientific article; zbMATH DE number 3564005 (Why is no real title available?)
• scientific article; zbMATH DE number 3327849 (Why is no real title available?)
• scientific article; zbMATH DE number 3354002 (Why is no real title available?)
• Long repetitive patterns in random sequences
• On a new law of large numbers
• 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
• Three problems on the lengths of increasing runs

Cited in

(5)

• On the length of the longest run in a multi-state Markov chain.
• Longest runs in a sequence of \(m\)-dependent random variables
• Rate of convergence in the problem of the longest head-run
• The \(m\)th longest runs of multivariate random sequences
• How short might be the longest run in a dynamical coin tossing sequence

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

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