论文信息 - An application of the method of finite Markov chain imbedding to runs tests

An application of the method of finite Markov chain imbedding to runs tests

Abstract The method of finite Markov chain imbedding developed by Fu and Koutras (1994) has become a popular and useful tool for studying runs and patterns-related problems. In this article, their approach is used as an alternative for obtaining the exact conditional distribution of the success runs statistic given the number of successes in a sequence of n i.i.d. Bernoulli trials, which, in the past, was computed mainly from traditional combinatorics.

W. Lou | W.Y.Wendy Lou

[1] F N DAVID. A power function for tests of randomness in a sequence of alternatives. , 1947, Biometrika.

[2] James C. Fu,et al. On Reliability of a Large Consecutive-k-out-of-n:F System with (k - 1)-step Markov Dependence , 1987, IEEE Transactions on Reliability.

[3] Keisuke Hirano,et al. Some Properties of the Distributions of Order k , 1986 .

[4] C. Eisenhart,et al. Tables for Testing Randomness of Grouping in a Sequence of Alternatives , 1943 .

[5] Andreas N. Philippou,et al. Fibonacci Numbers and Their Applications , 1986 .

[6] W. Lou. On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding , 1996 .

[7] J. Wolfowitz,et al. On a Test Whether Two Samples are from the Same Population , 1940 .

[8] Anant P. Godbole,et al. Specific formulae for some success run distributions , 1990 .

[9] J. Fu,et al. DISTRIBUTION THEORY OF RUNS AND PATTERNS ASSOCIATED WITH A SEQUENCE OF MULTI-STATE TRIALS , 1996 .