Rate of convergence in the problem of the longest head-run

DOI10.1007/BF00970481zbMath0818.60017OpenAlexW2164524006MaRDI QIDQ1177453

Serguei Novak

Publication date: 26 June 1992

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00970481

zbMATH Keywords

rate of convergenceMarkov chainlongest run

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (2)

Asymptotic expansions for the maximum of random number of random variables ⋮ On the length of the longest head run

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching rectangles in d-dimensions: Algorithms and laws of large numbers
• An extreme value theory for long head runs
• Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence
• On a new law of large numbers
• A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
• Long repetitive patterns in random sequences
• Run Probabilities in Sequences of Markov-Dependent Trials
• ON THE POWER FUNCTION OF THE LONGEST RUN AS A TEST FOR RANDOMNESS IN A SEQUENCE OF ALTERNATIVES

This page was built for publication: Rate of convergence in the problem of the longest head-run