Summary
A real-valued discrete time Markov Chain {X n} is defined to be stochastically monotone when its one-step transition probability function pr {X n+1≦y¦ X n=x} is non-increasing in x for every fixed y. This class of Markov Chains arises in a natural way when it is sought to “bound” (stochastically speaking) the process {X n} by means of a “smaller” or “larger” process with the same transition probabilities; the class includes many simple models of applied probability theory. Further, a given stochastically monotone Markov Chain can readily be “bounded” by another chain {Y n}, with possibly different transition probabilities and not necessarily stochastically monotone, and this is of particular value when the latter process leads to simpler algebraic manipulations. A stationary stochastically monotone Markov Chain {X n} has cov(f(X 0), f(X n)) ≧ cov(f(X 0), f(X n+1))≧0 (n =1, 2,...) for any monotonic function f(·). The paper also investigates the definition of stochastic monotonicity on a more general state space, and the properties of integer-valued stochastically monotone Markov Chains.
Article PDF
Similar content being viewed by others
References
Beneš, V. E.: On queues with Poisson arrivals. Ann. math. Statistics 25, 670–677 (1957).
Chung, K. L.: Markov chains with stationary transition probabilities. Berlin-Göttingen-Heidelberg: Springer 1960.
Daley, D. J.: The serial correlation coefficients of waiting times in a stationary single server queue. J. Austral. math. Soc. (to appear).
—, and P. A. P. Moran: Two-sided inequalities for waiting time and queue size distribu-tions in GI/G/I. Teor. Verojatn. Primen. 13, 356–359 (1968).
Esary, J. D., F. Proschan, and D. W. Walkup: Association of random variables, with applications. Ann. math. Statistics 38, 1466–1474 (1967).
Hodges, J. L., and M. Rosenblatt: Recurrence time moments in random walks. Pacific. J. Math. 3, 127–136 (1953).
Kalmykov, G. I.: On the partial ordering of one-dimensional Markov processes. Theor. Probab. Appl. 7, 456–459 (1962).
Kelley, J.: General topology. New York: Van Nostrand 1955.
Lehmann, E. L.: Some concepts of dependence. Ann. math. Statistics 37, 1137–1153 (1966).
Lindlcy, D. V.: The theory of queues with a single server. Proc. Cambridge philos. Soc. 48, 277–289 (1952).
Moran, P. A. P.: The survival of a mutant gene under selection. II. J. Austral. math. Soc. 1, 485–491 (1960).
Seneta, E.: On the transient behaviour of a Poisson branching process. J. Austral. math. Soc. 7, 465–480 (1967).
Spitzer, F.: Principles of random walk. New York: Van Nostrand 1964.
Whittle, P.: The outcome of a stochastic epidemic — a note on Bailey's paper. Biometrika 42, 116–122 (1955).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Daley, D.J. Stochastically monotone Markov Chains. Z. Wahrscheinlichkeitstheorie verw Gebiete 10, 305–317 (1968). https://doi.org/10.1007/BF00531852
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00531852