Relation between Hitting Times and Probabilities for Imprecise Markov Chains
math.PR
Submitted: 2026-03-17
Updated: 2026-10-30
Comments: Published for International Conference on Soft Methods in Probability and Statistics (SMPS)
License: http://creativecommons.org/licenses/by/4.0/
The gist: In this paper, we investigate the relation between hitting times and hitting probabilities in discrete-time imprecise Markov chains (IMCs).
Terminology
Abstract
In this paper, we investigate the relation between hitting times and hitting probabilities in discrete-time imprecise Markov chains (IMCs). We define lower and upper hitting times and probabilities for IMCs whose set of transition matrices is compact, convex, and has separately specified rows. Building on reachability-based partitions of the state space, we prove two key implications: (i) finiteness of the upper expected hitting time entails the lower hitting probability equals one, and (ii) finiteness of the lower expected hitting time entails the upper hitting probability equals one. We further show an equivalence: the upper expected hitting time is finite if and only if the lower hitting probability is one. Finally, by presenting a counterexample, we show that the converse of the second implication can fail.
Sources
- A convenient characterisation of convergent upper transition operators
- Computing Lower and Upper Hitting Probabilities for Imprecise Markov Chains
- Hitting Times and Probabilities for Imprecise Markov Chains
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves
- A zero-one law for swap-invariant events in uniform spanning forests
- Bernoulli flow for Erd s-R'enyi graphs