Skip to main content
Log in

Estimation of Finite Probabilities via Aggregation of Markov Chains

  • Stochastic Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

An aggregated (trivial) chain with fewer number of states than for the initial Markov chain is constructed such that the finite probabilities of aggregated states equal the finite probabilities of the corresponding states of the initial Markov chain. A method is developed for determining the upper and lower estimates of finite probabilities of aggregated states from data defining the initial Markov chain. These estimates are related with the necessary and sufficient conditions for the classical aggregation of Markov chains. An example on computations is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Tsertsvadze, G.N., Aggregation of Markov Chains, Soob. Akad. Nauk GSSR, 1988, no. 2.

  2. Karmanov, A.V., Issledovanie upravlyaemykh konechnykh markovskikh tsepei s nepolnoi informatsiei (Controlled Finite Markov Chain with Incomplete Information), Moscow: Nauka, 2002.

    Google Scholar 

  3. Tsertsvadze, G.N., Aggregation and Enlargement of Markov Chains, Soob. Akad. Nauk GSSR, 1988, no. 3.

  4. Kemeny, J. and Snell, J., Finite Markov Chains, The University Series in Undergraduate Mathematics, New York: Academic. Translated under the title Konechnye tsepi Markova, Moscow: Nauka, 1970.

    Google Scholar 

  5. Bather, J., Optimal Decision Procedures for Finite Markov Chains. Part II: Communicating Systems, Adv. Appl. Prob., 1973, nos. 3, 5, pp. 521–540.

  6. Howard, R.A., Dynamic Programming and Markov Processes, Cambridge: Massachusetts Inst. of Technology, 1960. Translated under the title Dinamicheskoe programmirovanie i markovskie protsessy, Moscow: Sovetskoe Radio, 1964.

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Avtomatika i Telemekhanika, No. 10, 2005, pp. 120–127.

Original Russian Text Copyright © 2005 by Karmanov, Karmanova.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karmanov, A.V., Karmanova, L.A. Estimation of Finite Probabilities via Aggregation of Markov Chains. Autom Remote Control 66, 1640–1646 (2005). https://doi.org/10.1007/s10513-005-0197-8

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10513-005-0197-8

Keywords

Navigation