Level-crossing ordering of semi-Markov processes and markov chains

DOI10.1239/jap/1134587811zbMath1106.60070OpenAlexW2038474536WikidataQ59323935 ScholiaQ59323935MaRDI QIDQ5476143

António Pacheco, Fátima Ferreira

Publication date: 29 June 2006

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1134587811

zbMATH Keywords

sojourn timetransition matrics

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov renewal processes, semi-Markov processes (60K15) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (4)

Sequence graph transform (SGT): a feature embedding function for sequence data mining ⋮ On the Laplace transform of the Pareto distribution ⋮ Comparison of level-crossing times for Markov and semi-Markov processes ⋮ Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The detection of words and an ordering for Markov chains
• Stochastic Comparisons for Non-Markov Processes
• 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