Covering runs in binary Markov sequences

DOI10.1515/156939203322109104MaRDI QIDQ4809613zbMATH OpenOpenAlexFDO

Authors L. Ya. Savel'ev, S. V. Balakin, B. V. Khromov

Publication date 30 August 2004

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

Full work available at URL https://doi.org/10.1515/156939203322109104

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Cover times for Markov-generated binary sequences of length two
• The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences
• A combinatorial approach to calculation of moments of characteristics of runs in ternary Markov sequences
• scientific article; zbMATH DE number 777867
• scientific article; zbMATH DE number 27022

Cites work

• scientific article; zbMATH DE number 3172038 (Why is no real title available?)
• scientific article; zbMATH DE number 1222139 (Why is no real title available?)
• scientific article; zbMATH DE number 714508 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Random correspondences, binary matrices, and runs

Cited in

(5)

• On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence
• Cover times for Markov-generated binary sequences of length two
• Covering problems for Markov chains
• Some applications of the stochastic theory of runs
• A combinatorial approach to calculation of moments of characteristics of runs in ternary Markov sequences

This page was built for publication: Covering runs in binary Markov sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809613)