An efficient algorithm for sampling from sin^k(x) for generating random correlation matrices

09/14/2018

∙

by   Enes Makalic, et al.

∙

0

∙

share

In this note, we develop a novel algorithm for generating random numbers from a distribution with probability density function proportional to sin^k(x), x ∈ (0,π) and k ≥ 1. Our algorithm is highly efficient and is based on rejection sampling where the envelope distribution is an appropriately chosen beta distribution. An example application illustrating how the new algorithm can be used to generate random correlation matrices is discussed.