RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2003 Volume 15, Issue 1, Pages 50–76 (Mi dm185)

This article is cited in 3 papers

Covering runs in binary Markov sequences

L. Ja. Savel'ev, S. V. Balakin, B. V. Khromov


Abstract: We describe distributions of the lengths of initial, covering, and final runs in binary Markov sequences. For the means and variances, we give exact and asymptotic formulas. We also give the generating functions. We observe that in Markov sequences the probabilities of run lengths do not necessarily decrease as the lengths grow, and hence, the corresponding distributions may be of quite complex form. We investigate conditions under which, due to the Markov property, the probabilities increase as the run lengths do. We consider operator equations which include final runs.
This research was supported by the Russian Foundation for Basic Research, grant 02–01–00946.

UDC: 519.2

Received: 17.11.2002

DOI: 10.4213/dm185


 English version:
Discrete Mathematics and Applications, 2003, 13:2, 111–138

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024