A combinatorial approach to calculation of moments of characteristics of runs in ternary Markov sequences

DOI10.1515/DMA.2011.004zbMath1218.60063MaRDI QIDQ3008823

S. V. Balakin, L. Ya. Savel'ev

Publication date: 22 June 2011

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (1)

ESTIMATOR FOR THE DISTRIBUTION OF THE NUMBERS OF RUNS IN A RANDOM SEQUENCE CONTROLLED BY STATIONARY MARKOV CHAIN

Cites Work

• On number of occurrences of success runs of specified length in a higher-order two-state Markov chain
• The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences

This page was built for publication: A combinatorial approach to calculation of moments of characteristics of runs in ternary Markov sequences