arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.07847math.PR
收藏

$(k_1, k_2)$ -游程的伪二项逼近

Pseudo-binomial Approximation to $(k_1, k_2)$-runs

A. N. Kumar, N. S. Upadhye

摘要:

($k_1,k_2$)-游程在文献中得到了特别的关注,并且其分布可以使用组合方法(Huang和Tsai)和马尔可夫链方法(Dafnis等人)来获得。但当相同设置下的伯努利试验次数太多时,该公式很难使用,而在非相同设置下,该公式通常很难使用。因此,用合适的随机变量来近似它是有用的。本文证明了伪二项分布是最适合于近似的分布,并利用Stein方法导出了近似结果。此外,这些结果的应用是通过现实生活中的问题。结果表明,得到的界限是可比的或改进的界限,在文献中。

英文摘要:

($k_1,k_2$)-runs have received a special attention in the literature and its distribution can be obtained using combinatorial method (Huang and Tsai) and Markov chain approach (Dafnis et al). But the formulae are difficult to use when the number of Bernoulli trials is too large under identical setup and is generally intractable under non-identical setup. So, it is useful to approximate it with a suitable random variable. In this paper, it is demonstrated that pseudo-binomial is most suitable distribution for approximation and the approximation results are derived using Stein's method. Also, application of these results is demonstrated through real-life problems. It is shown that the bounds obtained are either comparable to or improvement over bounds available in the literature.

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

↑