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

Abstract

In this note, we develop a novel algorithm for generating random numbers from a distribution with a probability density function proportional to 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…