An Efficient Algorithm for the Distribution of Numbers of Non-overlapping Runs in a Sequence of s-kind Outcomes

DOI Web Site 16 References

Bibliographic Information

Other Title
  • s種類の結果を有する試行列における連の分布の効率的な算出方法 : オーバーラップを許さない場合
  • s種類の結果を有する試行列における運の分布の効率的な算出方法--オーバーラップを許さない場合
  • s シュルイ ノ ケッカ オ ユウスル シコウレツ ニ オケル ウン ノ ブンプ ノ コウリツテキ ナ サンシュツ ホウホウ オーバーラップ オ ユルサナイ バアイ

Search this article

Description

In this paper, we consider the joint distribution of numbers in s-kind of runs in a sequence of independent trials with s possible outcomes in each trial. Though there are four ways of counting the number of runs, we focus on the non-overlapping enumeration scheme (Type I enumeration scheme), and propose an efficient algorithm for evaluating the distributions of the numbers in non-overlapping runs. We give the order of computing time and memory capacity of the proposed algorithm. Furthermore, we carry out numerical experiments to compare the performance of the proposed algorithm with that of the conventional enumeration algorithm with respect to computing time. The results show that the proposed algorithm is more efficient than the enumeration algorithm.

Journal

References(16)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top