Hostname: page-component-cb9f654ff-65tv2 Total loading time: 0 Render date: 2025-09-02T08:14:43.062Z Has data issue: false hasContentIssue false
  • English
  • Français

Reversibility of Markov chains with applications to storage models

Published online by Cambridge University Press:  14 July 2016

Hideo Ōsawa
Hideo Ōsawa*
Affiliation:
University of Electro-Communications, Tokyo
*
∗ Postal address: Department of Mathematical Statistics, The University of Electro-Communications, 1–5–1 Chofugaoka, Chofu-shi, Tokyo 182, Japan.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper studies the reversibility conditions of stationary Markov chains (discrete-time Markov processes) with general state space. In particular, we investigate the Markov chains having atomic points in the state space. Such processes are often seen in storage models, for example waiting time in a queue, insurance risk reserve, dam content and so on. The necessary and sufficient conditions for reversibility of these processes are obtained. Further, we apply these conditions to some storage models and present some interesting results for single-server queues and a finite insurance risk model.

Keywords

STATIONARY MARKOV CHAININVARIANT MEASUREATOMIC POINTSWAITING TIME IN QUEUE

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 22 , Issue 1 , March 1985 , pp. 123 - 137
Copyright
Copyright © Applied Probability Trust 1985 

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

Kawata, T. (1972) Fourier Analysis in Probability Theory. Academic Press, New York.Google Scholar
Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
Kobayashi, H. (1983) Stochastic modeling: queueing models. In Probability Theory and Computer Science, ed. Louchard, G. and Latouche, G. Academic Press, New York.Google Scholar
Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–289.Google Scholar
Prabhu, N. U. (1980) Stochastic Storage Processes. Springer-Verlag, New York.Google Scholar
Suomela, P. (1979) Invariant measures of time-reversible Markov chains. J. Appl. Prob. 16, 226–229.CrossRefGoogle Scholar