Generates random matrices, distributed according to the G-Wishart distribution with parameters b and D, *W_G(b, D)*.

1 |

`n` |
The number of samples required. The default value is 1. |

`adj.g` |
The adjacency matrix corresponding to the graph structure. It should be an upper triangular matrix in which |

`b` |
The degree of freedom for G-Wishart distribution, |

`D` |
The positive definite |

Sampling from G-Wishart distribution, *K \sim W_G(b, D)*, with density:

*Pr(K) \propto |K| ^ {(b - 2) / 2} \exp ≤ft\{- \frac{1}{2} \mbox{trace}(K \times D)\right\},*

which *b > 2* is the degree of freedom and D is a symmetric positive definite matrix.

A numeric array, say A, of dimension *(p \times p \times n)*, where each *A[,,i]* is a positive
definite matrix, a realization of the G-Wishart distribution, *W_G(b, D)*.

Abdolreza Mohammadi and Ernst Wit

Lenkoski, A. (2013). A direct sampler for G-Wishart variates, *Stat*, 2:119-128

Mohammadi, A. and E. Wit (2015). Bayesian Structure Learning in Sparse Gaussian Graphical Models, *Bayesian Analysis*, 10(1):109-138

Mohammadi, A. and E. Wit (2015). BDgraph: An `R`

Package for Bayesian Structure Learning in Graphical Models, *arXiv:1501.05108*

Mohammadi, A., F. Abegaz Yazew, E. van den Heuvel, and E. Wit (2016). Bayesian modelling of Dupuytren disease by using Gaussian copula graphical models, *Journal of the Royal Statistical Society: Series C*

1 2 3 4 5 6 7 8 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.