Level-crossing ordering of semi-Markov processes and markov chains
From MaRDI portal
Publication:5476143
Recommendations
- Comparison of level-crossing times for Markov and semi-Markov processes
- Stochastic ordering for continuous-time processes
- Usual and stochastic tail orders between hitting times for two Markov chains
- Level Crossing Ordering of Skip-Free-to-the-Right Continuous-Time Markov Chains
- Comparing first-passage times for semi-Markov skip-free processes
Cites work
- scientific article; zbMATH DE number 54039 (Why is no real title available?)
- scientific article; zbMATH DE number 605729 (Why is no real title available?)
- Comparison methods for stochastic models and risks
- Level Crossing Ordering of Skip-Free-to-the-Right Continuous-Time Markov Chains
- Stochastic Comparisons for Non-Markov Processes
- Stochastic ordering for continuous-time processes
- The detection of words and an ordering for Markov chains
Cited in
(8)- Sequence graph transform (SGT): a feature embedding function for sequence data mining
- The crossing barrier of a non-homogeneous semi-Markov chain
- Comparison of level-crossing times for Markov and semi-Markov processes
- On the Laplace transform of the Pareto distribution
- Usual and stochastic tail orders between hitting times for two Markov chains
- Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
- Stochastic ordering for continuous-time processes
- Level Crossing Ordering of Skip-Free-to-the-Right Continuous-Time Markov Chains
This page was built for publication: Level-crossing ordering of semi-Markov processes and markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5476143)