Central limit theorem approximations for the number of runs in Markov-dependent binary sequences

DOI10.1016/J.JSPI.2012.07.014zbMath1256.60011OpenAlexW1991197393MaRDI QIDQ1926547

Michael A. Zazanis, George C. Mytalas

Publication date: 28 December 2012

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2012.07.014

zbMATH Keywords

Markov chainspotential matrixrunscentral limit theorem for runs

Mathematics Subject Classification ID

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

Related Items (11)

On the concentration of runs of ones of length exceeding a threshold in a Markov chain ⋮ On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence ⋮ On ℓ-overlapping Runs of Ones of Lengthkin Sequences of Independent Binary Random Variables ⋮ Distributions of statistics describing concentration of runs in non homogeneous Markov-dependent trials ⋮ On the modes of the negative binomial distribution of order k, type I ⋮ Joint distribution of \(k\)-tuple statistics in zero-one sequences of Markov-dependent trials ⋮ On the distribution of the number of success runs in a continuous time Markov chain ⋮ ESTIMATOR FOR THE DISTRIBUTION OF THE NUMBERS OF RUNS IN A RANDOM SEQUENCE CONTROLLED BY STATIONARY MARKOV CHAIN ⋮ Generalizations of runs and patterns distributions for sequences of binary trials ⋮ Central Limit Theorem Approximations for the Number of Runs in Markov-dependent Multi-type Sequences ⋮ Length of the minimum sequence containing repeats of success runs

This page was built for publication: Central limit theorem approximations for the number of runs in Markov-dependent binary sequences