Exponential moments of simultaneous hitting time for non-atomic Markov chains

Pub Date : 2022-06-28 DOI:10.3336/gm.57.1.09
V. Golomoziy
{"title":"Exponential moments of simultaneous hitting time for non-atomic Markov chains","authors":"V. Golomoziy","doi":"10.3336/gm.57.1.09","DOIUrl":null,"url":null,"abstract":"This paper is devoted to studying the first simultaneous hitting time of a given set by two discrete-time, inhomogeneous Markov chains with values in general phase space. Established conditions for the existence of the hitting time's exponential moment. Computable bounds for the exponential moment are obtained under the condition of stochastic dominance.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3336/gm.57.1.09","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper is devoted to studying the first simultaneous hitting time of a given set by two discrete-time, inhomogeneous Markov chains with values in general phase space. Established conditions for the existence of the hitting time's exponential moment. Computable bounds for the exponential moment are obtained under the condition of stochastic dominance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
非原子马尔可夫链同时撞击时间的指数矩
本文研究了一般相空间中两个离散非齐次马尔可夫链对给定集合的首次同时碰撞时间。建立了撞击时间指数矩存在的条件。在随机优势条件下,得到了指数矩的可计算界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1