Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-24T03:52:51.423Z Has data issue: false hasContentIssue false

COMPARISONS OF DEPENDENCE FOR STATIONARY MARKOV PROCESSES

Published online by Cambridge University Press:  01 July 2000

Taizhong Hu
Affiliation:
Department of Statistics and Finance, University of Science and Technology of China, Hefei, Anhui 230026, People's Republic of China
Xiaoming Pan
Affiliation:
Department of Statistics and Finance, University of Science and Technology of China, Hefei, Anhui 230026, People's Republic of China

Abstract

Results and conditions which quantify the decrease in dependence with lag for a stationary Markov process and enable one to compare the dependence for two stationary Markov processes are obtained. The notions of dependence used in this article are the supermodular ordering and the concordance ordering. Both discrete-time and continuous-time Markov processes are considered. Some applications of the main results are given. In queueing theory, the monotonicity results of the waiting time of the nth customer as well as the stationary waiting time in an MR/GI/1 queue and the stationary workload in a Markov-modulated queue are established, thus strengthening previous results while simplifying their derivation. This article is a continuation of those by Fang et al. [7] and Hu and Joe [10].

Type
Research Article
Copyright
© 2000 Cambridge University Press

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.)

Footnotes

Supported by NSF grant 19701030, the Doctoral Program Foundation of Insititute of High Education and a grant of Chinese Academy of Sciences.