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


Sooner and later waiting time problems in a two-state Markov chain
Authors:Masayuki Uchida  Sigeo Aki
Institution:(1) Department of Mathematical Science, Faculty of Engineering Science, Osaka University, Machikaneyama-cho, 560 Toyonaka, Osaka, Japan;(2) Present address: the Institute of Statistical Mathematics, Japan
Abstract:LetX 1,X 2,... be a time-homogeneous {0, 1}-valued Markov chain. LetF 0 be the event thatl runs of ldquo0rdquo of lengthr occur and letF 1 be the event thatm runs of ldquo1rdquo of lengthk occur in the sequenceX 1,X 2, ... We obtained the recurrence relations of the probability generating functions of the distributions of the waiting time for the sooner and later occurring events betweenF 0 andF 1 by the non-overlapping way of counting and overlapping way of counting. We also obtained the recurrence relations of the probability generating functions of the distributions of the sooner and later waiting time by the non-overlapping way of counting of ldquo0rdquo-runs of lengthr or more and ldquo1rdquo-runs of lengthk or more.
Keywords:Sooner and later problems  discrete distribution  Markov chain  recurrence relations  overlapping  non-overlapping  non-over-lapping ldquo0gif" alt="ldquo" align="MIDDLE" BORDER="0">0rdquo-runs of lengthr or more" target="_blank">gif" alt="rdquo" align="MIDDLE" BORDER="0">-runs of lengthr or more  generalized probability generating function
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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