A New Method for Generating Random Correlation Matrices

10/15/2022
by   Ilya Archakov, et al.
0

We propose a new method for generating random correlation matrices that makes it simple to control both location and dispersion. The method is based on a vector parameterization, gamma = g(C), which maps any distribution on R^d, d = n(n-1)/2 to a distribution on the space of non-singular nxn correlation matrices. Correlation matrices with certain properties, such as being well-conditioned, having block structures, and having strictly positive elements, are simple to generate. We compare the new method with existing methods.

READ FULL TEXT

page 4

page 15

page 19

research
09/13/2018

On equivalence of the LKJ distribution and the restricted Wishart distribution

In this paper, we want to show the Restricted Wishart distribution is eq...
research
09/14/2018

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

In this note, we develop a novel algorithm for generating random numbers...
research
12/18/2018

Parametrising correlation matrices

Correlation matrices are the sub-class of positive definite real matrice...
research
04/07/2020

Bootstraps Regularize Singular Correlation Matrices

I show analytically that the average of k bootstrapped correlation matri...
research
09/02/2018

A fast Metropolis-Hastings method for generating random correlation matrices

We propose a novel Metropolis-Hastings algorithm to sample uniformly fro...
research
12/04/2020

A New Parametrization of Correlation Matrices

We introduce a novel parametrization of the correlation matrix. The repa...
research
01/25/2023

Stray field computation by inverted finite elements: a new method in micromagnetic simulations

In this paper, we propose a new method for computing the stray-field and...

Please sign up or login with your details

Forgot password? Click here to reset