On the Length of the Longest Head-Run for a Markov Chain with Two States

DOI10.1137/1126056zbMath0487.60061OpenAlexW2010066146MaRDI QIDQ3948409

S. S. Samarova

Publication date: 1982

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1126056

zbMATH Keywords

longest head-run in the trajectory of a Markov chain

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequence ⋮ Erdős-Rényi laws for Gibbs measures ⋮ Maximal success durations for a semi-Markov process ⋮ A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials ⋮ Longest runs in coin tossing ⋮ On longest consecutive patterns in Markov chains ⋮ Binomial approximation for sum of indicators with dependent neighborhoods ⋮ The Hausdorff dimension of level sets described by Erdős-Rényi average ⋮ Some results associated with the longest run in a strongly ergodic Markov chain ⋮ Limiting behaviors for longest consecutive switches in an IID Bernoulli sequence ⋮ On the length of the longest run in a multi-state Markov chain. ⋮ К вопросу о предельном распределении серий в случайной двоичной последовательности ⋮ Digital search trees and chaos game representation