Usual and stochastic tail orders between hitting times for two Markov chains

DOI10.1002/asmb.2177zbMath1406.60103OpenAlexW2396882166MaRDI QIDQ4624945

Emilio De Santis, Fabio L. Spizzichino

Publication date: 20 February 2019

Published in: Applied Stochastic Models in Business and Industry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/asmb.2177

zbMATH Keywords

hitting timesstochastic monotonicitytail orderorderings of stochastic matrices

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (5)

A stochastic model of cyber attacks with imperfect detection ⋮ Reachability and safety objectives in Markov decision processes on long but finite horizons ⋮ Ranking graphs through hitting times of Markov chains ⋮ On relevation redundancy to coherent systems at component and system levels ⋮ Stochastic precedence and minima among dependent variables

Cites Work

• Unnamed Item
• Unnamed Item
• On Cox processes and credit risky securities
• Hitting time distribution for skip-free Markov chains: a simple proof
• Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings
• On hitting times and fastest strong stationary times for skip-free and more general chains
• On times to quasi-stationarity for birth and death processes
• Non-negative matrices and Markov chains. 2nd ed
• Stochastic ordering and dependence in applied probability
• Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains
• Stochastic Comparison of Queueing Networks
• On absorption times and Dirichlet eigenvalues
• The detection of words and an ordering for Markov chains
• Markov Chains
• Markov Chains
• Dependence Comparison of Multivariate Extremes via Stochastic Tail Orders

This page was built for publication: Usual and stochastic tail orders between hitting times for two Markov chains