An Algorithm of a Longest of Runs Test for Very Long
Sequences of Bernoulli Trials
by Alexander I. Kozynchenko
runs test is proposed for the case of equal
probability Bernoulli trials processes. The algorithm is
founded on the analysis of the event tree diagram, which
has discovered the role of Fibonacci numbers of higher
orders in counting the number of outcomes of interest in
the sample space. Compared to the classical
combinatorial formulas, the proposed algorithm provides
the error-free exact probabilities and makes possible
the processing of very long binomial data sets (up to
1000) on contemporary computers.
Runs Tests, Longest Run, Bernoulli Trials,
Fibonacci Numbers, Computing Algorithms
Alexander I. Kozynchenko, firstname.lastname@example.org
Wej-Min Huang, email@example.com
READING THE ARTICLE: You can read the article in
portable document (.pdf) format (113709 bytes.)
NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.
This page has been accessed 2152 times since NOVEMBER 21, 2008.
Return to the Home Page.