Evaluation of Beta Generation Algorithms
Ying‐Chao Hung, N. Balakrishnan, Yi-Te Lin · Communications in Statistics - Simulation and Computation · 2009
In this article, we provide an overview of well-known beta algorithms. We first study a stochastic search procedure proposed by Kennedy (1988 Kennedy , D. P. ( 1988 ). A note on stochastic search methods for global optimization . Advances in Applied Probability 20 : 476 – 478 .[Crossref], [Web of Science ®] , [Google Scholar]) that asymptotically generates a beta variate. The goal is to identify the optimal parameter setting so that Kennedy's algorithm can achieve the fastest speed of generation. For comparative purposes, we next evaluate the performance of some selected beta algorithms in terms of the following criteria: (i) validity of choice of shape parameters; (ii) computer generation time; (iii) initial set-up time; (iv) goodness of fit; and (v) amount of random number generation required. Based on the empirical study, we present three useful guidelines for choosing the best suited beta algorithm.