在這篇文章中，我們提供一些用以生成 Dirichlet 隨機向量的演算法，並根據以下標準來評估這些演算法的表現：（一）電腦生成時間；（二）敏感度；以及（三）適合度。另外，我們特別檢驗一個基於 beta 變量轉換的演算法，並提供三個方針以減少此演算法的生成時間。模擬的結果顯示，除了所有（或大部分）的形狀變數都相當接近零的情況之外，基於我們所提出的方針整合而成的演算法顯著地在電腦生成時間上勝過其他的演算法。 In this article, we describe various well-known Dirichlet generation algorithms and evaluate their performance in terms of the following criteria: (i) computer generation time, (ii) sensitivity, and (iii) goodness-of-fit. In addition, we examine in particular an algorithm based on transformation of beta variates and provide three useful guidelines so as to reduce its computer generation time. Simulation results show that the proposed algorithm outperforms significantly other approaches in terms of computer generation time, except in cases when all (or most) shape parameters are close to zero.
