Level Crossing Ordering of Skip-Free-to-the-Right Continuous-Time Markov Chains
DOI10.1239/JAP/1110381370zbMATH Open1074.60021OpenAlexW2027965394WikidataQ59323931 ScholiaQ59323931MaRDI QIDQ5312840FDOQ5312840
Publication date: 25 August 2005
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1110381370
Inequalities; stochastic orderings (60E15) Queueing theory (aspects of probability theory) (60K25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Continuous-time Markov processes on discrete state spaces (60J27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparison methods for stochastic models and risks
- A continuous-time Markov chain under the influence of a regulating point process and applications in stochastic models with catastrophes
- Birth, immigration and catastrophe processes
- TRANSIENT ANALYSIS OF IMMIGRATION BIRTH–DEATH PROCESSES WITH TOTAL CATASTROPHES
- Title not available (Why is that?)
- Stochastic ordering for continuous-time processes
- Monotonicity and comparability of time-homogeneous markov processes with discrete state space
- The detection of words and an ordering for Markov chains
- Preservation of some partial orderings under Poisson shock models
Cited In (3)
Recommendations
- Comparison of level-crossing times for Markov and semi-Markov processes 👍 👎
- Level-crossing ordering of semi-Markov processes and markov chains 👍 👎
- Stochastic ordering for continuous-time processes 👍 👎
- Comparing first-passage times for semi-Markov skip-free processes 👍 👎
- Level-crossing ordering of \(M/M/c\) retrial queues 👍 👎
This page was built for publication: Level Crossing Ordering of Skip-Free-to-the-Right Continuous-Time Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312840)
