English

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

Computation 2018-11-22 v2

Abstract

In this note, we develop a novel algorithm for generating random numbers from a distribution with a probability density function proportional to sink(x)\sin^k(x), x(0,π)x \in (0,\pi) and k1k \geq 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.

Keywords

Cite

@article{arxiv.1809.05212,
  title  = {An efficient algorithm for sampling from $\sin^k(x)$ for generating random correlation matrices},
  author = {Enes Makalic and Daniel F. Schmidt},
  journal= {arXiv preprint arXiv:1809.05212},
  year   = {2018}
}