首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Maximal success durations for a semi-Markov process
Institution:Saxpy Computer Corporation, 255 San Geronimo Way, Sunnyvale, CA 94086, USA;Department of Mathematics, Stanford University, Stanford, CA 94305, USA
Abstract:Asymptotic distributional theorems are presented for the maximal sojourn duration on a semi-Markov chain and for the first passage time until a lengthy duration. Our analysis characterizes the limiting behavior of the longest “generalized success outcome” on a semi-Markov chain. The models include long runs on a single state, on a group of states, and on a set of transitions between states. Applications to success durations containing interruptions and to durations having infinite mean length are also presented.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号