On Reliable Identification of Two Independent Markov Chain Distributions
Abstract
In this paper the problem of logarithmically asymptotically optimal (LAO) identification of distributions for two independent simple homogeneous stationary Markov chains with finite number of states is studied. The problem of identification under reliability requirement of distributions for one Markov chain was studied by Haroutunian and Navaei.
References
R.F. Ahlswede and E.A. Haroutunian, “On logarithmically asymptotically optimal testing of hypotheses and identification", Lecture Notes in Computer Science, vol. 4123. “General Theory of Information Transfer and Combinatorics", Springer, pp. 462-478, 2006.
E.A. Haroutunian and Hakobyan P.M., On Identification of Distributions of Two Independent Objects", Mathematical Problems of Computer Science, vol. 28, pp. 114-119, 2007.
L. Navaei, “Application of LDT to many hypotheses optimal testing for Markov chain", Mathematical Problems of Computer Science, vol. 31, pp. 73-78, 2008.
L.Navaei, “Large deviations techniques for error exponents to many hypotheses LAO testing", Journal of modern applied statistical methods, USA, vol. 6, No. 3. pp. 487-491, 2007.
E.A. Haroutunian and N.M. Grigoryan, “On reliability approach for testing distributions for pair of Markov chains", Mathematical Problems of Computer Sciences, vol. 29, pp. 86-96, 2007.
E.A. Haroutunian and L. Navaei, On optimal identification of Markov chain distribution subject to the reliability criterion", Mathematical Problems of Computer Sciences, vol. 32, pp. 65-69,2009.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
