Exact Distributions of Waiting Time Problems of Mixed Frequencies and Runs in Markov Dependent Trials  

作　　者：Bruce J. Chaderjian Morteza Ebneshahrashoob Tangan Gao 

机构地区：[1]Department of Mathematics and Statistics, California State University, Long Beach, USA

出　　处：《Applied Mathematics》2012年第11期1689-1696,共8页应用数学（英文）

摘　　要：We study waiting time problems for first-order Markov dependent trials via conditional probability generating functions. Our models involve α frequency cells and β run cells with prescribed quotas and an additional γ slack cells without quotas. For any given and , in our Model I we determine the waiting time until at least frequency cells and at least run cells reach their quotas. For any given τ ≤ α + β, in our Model II we determine the waiting time until τ cells reach their quotas. Computer algorithms are developed to calculate the distributions, expectations and standard deviations of the waiting time random variables of the two models. Numerical results demonstrate the efficiency of the algorithms.We study waiting time problems for first-order Markov dependent trials via conditional probability generating functions. Our models involve α frequency cells and β run cells with prescribed quotas and an additional γ slack cells without quotas. For any given and , in our Model I we determine the waiting time until at least frequency cells and at least run cells reach their quotas. For any given τ ≤ α + β, in our Model II we determine the waiting time until τ cells reach their quotas. Computer algorithms are developed to calculate the distributions, expectations and standard deviations of the waiting time random variables of the two models. Numerical results demonstrate the efficiency of the algorithms.

关 键 词：Inverse Sampling MULTINOMIAL STOPPING Problem Soonest through Latest WAITING Time Variable Probability Generating Function First-Order MARKOV DEPENDENT Trial 

分 类 号：O1[理学—数学]