A Metropolis-Hastings based method for sampling from the \(G\)-Wishart distribution in Gaussian graphical models
DOI10.1214/11-EJS594zbMath1274.65009OpenAlexW2000045933WikidataQ105531941 ScholiaQ105531941MaRDI QIDQ1952170
Hélène Massam, Michael D. Escobar, Nicholas Mitsakakis
Publication date: 28 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ejs/1295457468
Metropolis-Hastings algorithmGaussian graphical modelsnon-decomposable graphs\(G\)-Wishart distributiondeviance information criterion
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjugate priors for exponential families
- Markov chains for exploring posterior distributions. (With discussion)
- Rates of convergence of the Hastings and Metropolis algorithms
- Simulation of hyper-inverse Wishart distributions for non-decomposable graphs
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Bayesian Measures of Model Complexity and Fit
- Cholesky decomposition of a hyper inverse Wishart matrix
- Independence Structure of Natural Conjugate Densities to Exponential Families and the Gibbs' Sampler
- Simulation of hyper-inverse Wishart distributions in graphical models
- A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models
This page was built for publication: A Metropolis-Hastings based method for sampling from the \(G\)-Wishart distribution in Gaussian graphical models