On the length of the longest head run
暂无分享,去创建一个
P. Révész | P. Erdos--P Revesz | I A | K ) = Max Sn | K.-S | I. A | K ) = Max Sn | K.S.
[1] E. Vaggelatou. On the length of the longest run in a multi-state Markov chain , 2003 .
[2] J. D. T. Oliveira,et al. The Asymptotic Theory of Extreme Order Statistics , 1979 .
[3] G BATEMAN,et al. On the power function of the longest run as a test for randomness in a sequence of alternatives. , 1948, Biometrika.
[4] Michael R. Chernick,et al. Runs and Scans With Applications , 2002, Technometrics.
[5] M. Muselli. New improved bounds for reliability of consecutive-k-out-of-n:F systems , 2000, Journal of Applied Probability.
[6] S. Novak. Time intervals of constant sojourn of a homogeneous Markov chain in a fixed subset of states , 1988 .
[7] S. Papastavridis,et al. Limit distribution for a consecuttve-k-out-of-n: F system , 1990 .
[8] J. Uspensky. Introduction to mathematical probability , 1938 .
[9] Steven J. Schwager,et al. Run Probabilities in Sequences of Markov-Dependent Trials , 1983 .
[10] A. Rényi,et al. On a new law of large numbers , 1970 .
[11] S. Novak,et al. Longest runs in a sequence ofm-dependent random variables , 1992 .
[12] W. Y. Wendy Lou,et al. ON EXACT AND LARGE DEVIATION APPROXIMATION FOR THE DISTRIBUTION OF THE LONGEST RUN IN A SEQUENCE OF TWO-STATE MARKOV DEPENDENT TRIALS , 2003 .
[13] Ron Goldman,et al. Poisson approximation , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.