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


Numbers of Success-Runs of Specified Length Until Certain Stopping Time Rules and Generalized Binomial Distributions of Order k
Authors:Sigeo Aki  Katuomi Hirano
Affiliation:(1) Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama-cho, Toyonaka, 560-8531, Japan;(2) The Institute of Statistical Mathematics, 4-6-7 Minani-Azabu, Minato-ku, Tokyo, 106-8569, Japan
Abstract:A new distribution called a generalized binomial distribution of order k is defined and some properties are investigated. A class of enumeration schemes for success-runs of a specified length including non-overlapping and overlapping enumeration schemes is rigorously studied. For each nonnegative integer mgr less than the specified length of the runs, an enumeration scheme called mgr-overlapping way of counting is defined. Let k and ell be positive integers satisfying ell < k. Based on independent Bernoulli trials, it is shown that the number of (ell– 1)-overlapping occurrences of success-run of length k until the n-th overlapping occurrence of success-run of length ell follows the generalized binomial distribution of order (kell). In particular, the number of non-overlapping occurrences of success-run of length k until the n-th success follows the generalized binomial distribution of order (k– 1). The distribution remains unchanged essentially even if the underlying sequence is changed from the sequence of independent Bernoulli trials to a dependent sequence such as higher order Markov dependent trials. A practical example of the generalized binomial distribution of order k is also given.
Keywords:Binomial distribution of order k  Markov chain  probability generating function  stopping time  success-run  waiting time
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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