2018
DOI: 10.1007/978-3-030-03493-1_13
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Metropolis-Hastings Method for Generating Random Correlation Matrices

Abstract: We propose a novel Metropolis-Hastings algorithm to sample uniformly from the space of correlation matrices. Existing methods in the literature are based on elaborated representations of a correlation matrix, or on complex parametrizations of it. By contrast, our method is intuitive and simple, based the classical Cholesky factorization of a positive definite matrix and Markov chain Monte Carlo theory. We perform a detailed convergence analysis of the resulting Markov chain, and show how it benefits from fast … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…The repetition number was 1,000. gmat v. 0.2.2 and cocor v. 1.1-3 R packages were used in the processes of data generating and implementing the statistical tests. 22,23 In real data example normality of the data was tested with the Shapiro-Wilk test. Relationships between the variables were evaluated with the Pearson correlation coefficient.…”
Section: Simulation Scenariosmentioning
confidence: 99%
“…The repetition number was 1,000. gmat v. 0.2.2 and cocor v. 1.1-3 R packages were used in the processes of data generating and implementing the statistical tests. 22,23 In real data example normality of the data was tested with the Shapiro-Wilk test. Relationships between the variables were evaluated with the Pearson correlation coefficient.…”
Section: Simulation Scenariosmentioning
confidence: 99%
“…, n. This reparametrization avoids having to estimate the components of R from ( 7) and instead estimates the elements of U since this will still uniquely determine R. Because of this uniqueness, subsequently we will refer to these u i,j as the correlation components of the GARCH process. For more details on fast sampling of correlation matrices, see [33]. The only exception in using this parametrization is when n = 2, the bivariate case.…”
Section: Reparametrization Of the Correlation Matrix Rmentioning
confidence: 99%
“…Gaussian graphical model simulation is covered in both Chapters 4 and 5. In particular, Chapter 4 is based on the conference article Córdoba et al (2018b), with Section 4.4.2 and the proof of Proposition 4.2.1 being novel material first appearing in this thesis. Such chapter serves as an introduction to the sampling methodology that is later applied to Gaussian graphical models in Chapter 5, largely based on both the conference article Córdoba et al (2018c) and the journal article Córdoba et al (2020c).…”
Section: Discussion Of the Resultsmentioning
confidence: 99%
“…It is primarily addressed in Córdoba et al (2018c), where a new simulation method for Gaussian Markov networks is proposed, and it is shown how it deeply affects different validation scenarios where several state-of-the-art learning methods are tested. In parallel, as a first step towards providing unbiased simulation for Gaussian graphical models, in Córdoba et al (2018b) a new method for uniform sampling of correlation matrices is detailed. This method is extended in Córdoba et al (2020a), providing uniform sampling for special types of Gaussian Markov and Bayesian networks.…”
Section: Contributionsmentioning
confidence: 99%