Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-04T21:52:21.028Z Has data issue: false hasContentIssue false
  • English
  • Français

Stochastic ordering for continuous-time processes

Part of: Markov processes Distribution theory - Probability

Published online by Cambridge University Press:  14 July 2016

A. Irle
A. Irle*
Affiliation:
Christian-Albrechts-Universität zu Kiel
*
∗ Postal address: Mathematisches Seminar, Christian-Albrechts-Universität zu Kiel, Ludewig-Meyn Str. 4, D-24098 Kiel, Germany. Email address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the following ordering for stochastic processes as introduced by Irle and Gani (2001). A process (Yt)t is said to be slower in level crossing than a process (Zt)t if it takes (Yt)t stochastically longer than (Zt)t to exceed any given level. In Irle and Gani (2001), this ordering was investigated for Markov chains in discrete time. Here these results are carried over to semi-Markov processes with particular attention to birth-and-death processes and also to Wiener processes.

Keywords

Stochastic orderlevel crossingsemi-Markov processesWiener processes

MSC classification

Primary: 60E15: Inequalities; stochastic orderings
Secondary: 60J25: Continuous-time Markov processes on general state spaces
Type
Research Papers
Information
Journal of Applied Probability , Volume 40 , Issue 2 , June 2003 , pp. 361 - 375
Copyright
Copyright © Applied Probability Trust 2003 

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

References

Daley, D. J. (1968). Stochastically monotone Markov chains. Z. Wahrscheinlichkeitsth. 10, 305–317.Google Scholar
Di Crescenzo, A., and Ricciardi, L. M. (1996). Comparing first-passage times for semi-Markov skip-free processes. Statist. Prob. Lett. 30, 247–256.Google Scholar
Irle, A., and Gani, J. (2001). Stochastic ordering and the detection of words. In Probability, Statistics and Seismology (J. Appl. Prob. Spec. Vol. 38A), ed. Daley, D. J., Applied Probability Trust, Sheffield, pp. 66–77.Google Scholar
Resnick, S. (1992). Adventures in Stochastic Processes. Birkhäuser, Boston, MA.Google Scholar
Shaked, M., and Shanthikumar, J. G. (1994). Stochastic Orders and Their Applications. Academic Press, Boston, MA.Google Scholar
Stoyan, D. (1983). Comparison Methods for Queues and Other Stochastic Models. John Wiley, Chichester.Google Scholar