首页> 外文期刊>Journal of Applied Probability >LIMIT THEOREMS FOR THE NUMBER OF OCCURRENCES OF CONSECUTIVE K SUCCESSES IN N MARKOVIAN TRIALS
【24h】

LIMIT THEOREMS FOR THE NUMBER OF OCCURRENCES OF CONSECUTIVE K SUCCESSES IN N MARKOVIAN TRIALS

机译:N个马尔可夫尝试中连续K成功次数出现的极限定理

获取原文
获取原文并翻译 | 示例
           

摘要

We present a method of deriving the limiting distributions of the number of occurrences of success (S) runs of length k for all types of runs under the Markovian structure with stationary transition probabilities. In particular, we consider the following four best-known types. 1. A string of S of exact length k preceded and followed by an F, except the first run which may not be preceded by an F, or the last run which may not be followed by an F. 2. A string of S of length k or more. 3. A string of S of exact length k, where recounting starts immediately after a run occurs. 4. A string of S of exact length k, allowing overlapping runs. It is shown that the limits are convolutions of two or more distributions with one of them being either Poisson or compound Poisson, depending on the type of runs in question. The completely stationary Markov case and the i.i.d. case are also treated. [References: 23]
机译:我们提出了一种方法,得出具有平稳转移概率的马尔可夫结构下所有类型运行的成功(S)运行长度为k的运行次数的限制分布。特别地,我们考虑以下四种最著名的类型。 1.确切长度为k的S字符串在F之前和之后,但第一轮可能不会以F开头,或者最后一轮可能不会以F开头。2. S的S字符串长度k或更大。 3.长度为k的S字符串,在运行之后立即开始重新计数。 4.精确长度为k的S字符串,允许重叠行。结果表明,极限是两个或多个分布的卷积,其中一个取决于泊松的类型,就是泊松或复合泊松。完全静止的马氏箱和i.i.d.情况也一样。 [参考:23]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号