arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.16675math.PR
收藏

不精确马尔可夫链中击中时间与概率的关系

Relation between Hitting Times and Probabilities for Imprecise Markov Chains

Eindhoven University of Technology(埃因霍温理工大学)

Marco Sangalli, Erik Quaeghebeur, Thomas Krak

AI总结:

研究不精确离散时间马尔可夫链中击中时间与概率的关系,证明击中时间有限性与概率为一的等价性,并展示逆向关系可能失效的反例。

摘要:

在本文中,我们研究不精确离散时间不精确马尔可夫链(IMCs)中击中时间和击中概率的关系。我们定义了对于转换矩阵集$\T$为紧致、凸且行分别指定的IMCs的下界和上界击中时间和概率。基于可达性基于的划分,我们证明了两个关键结论:(i) 上界期望击中时间有限性意味着下界击中概率等于一;(ii) 下界期望击中时间有限性意味着上界击中概率等于一。我们进一步展示等价性:上界期望击中时间有限当且仅当下界击中概率为一。最后,通过提供反例,我们展示第二个结论的逆向关系可能失效。

英文摘要:

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 $\T$ 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑