Hostname: page-component-89b8bd64d-rbxfs Total loading time: 0 Render date: 2026-05-06T20:09:42.306Z Has data issue: false hasContentIssue false
  • English
  • Français

An Error-Bound Theorem for Approximate Markov Chains

Published online by Cambridge University Press:  27 July 2009

Nico M. Van Dijk
Nico M. Van Dijk
Affiliation:
Free University Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

Recently an error-bound theorem was reported to conclude analytic error bounds for approximate Markov chains. The theorem required a uniform bound for marginal expectations of the approximate model. This note will relax this bound to steady state rather than marginal expectations as of practical interest

(i) to simplify verification and/or

(ii) to obtain a more accurate error bound.

A communication model is studied in detail to support the results.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 6 , Issue 3 , July 1992 , pp. 413 - 424
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Howard, R.A. (1960). Dynamic programming and Markov processes. New York: Wiley.Google Scholar
Kelly, F.P. (1979). Reversibility and stochastic networks. New York: Wiley.Google Scholar
Odoni, A.R. (1969). On finding the maximal gain for Markov decision processes. Operations Research 17: 857–860.CrossRefGoogle Scholar
Pinsky, E. & Yemini, Y. (1984). A statistical mechanics of some interconnection networks. Performance '84. Amsterdam: Elsevier (North-Holland).Google Scholar
Ross, S.M. (1970). Applied probability models with optimization application. Oakland, CA: Holden-Day.Google Scholar
Schweitzer, P.J. (1969). Perturbation theory and undiscounted Markov renewal programming. Operations Research 17: 716–727.CrossRefGoogle Scholar
Tijms, H.C. (1986). Stochastic modelling and analysis. New York: Wiley.Google Scholar
van, Dijk N.M. (1990). On error bound analysis for transient continuous-time reward structures. Performance Evaluation, research report. Amsterdam: Free University (to appear).Google Scholar
van, Dijk N.M. (1990). On the importance of bias-terms for error bounds and comparison results. In Stewart, W.J. (ed.), Numerical solutions of Markov chains. New York: Marcel Dekker, pp. 617–642.Google Scholar
Veltkamp, J.P. (1988). Cost functions for interference systems and VLSI high-level synthesis. Ph.D. thesis, Twente University, The Netherlands.Google Scholar