Efficient local updates for undirected graphical models

DOI10.1007/s11222-014-9541-6zbMath1331.62166MaRDI QIDQ5963562

Giovanni M. Marchetti, Francesco C. Stingo

Publication date: 22 February 2016

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2158/956938

zbMATH Keywords

Markov chain Monte Carlo; mixture priors; graphical model determination; local updates; perfect elimination order

Mathematics Subject Classification ID

62M40: Random fields; image analysis

62F15: Bayesian inference

92D10: Genetics and epigenetics

62A09: Graphical methods in statistics

Related Items

Bayesian Approaches for Large Biological Networks

Uses Software

• HdBCS

Cites Work

• Unnamed Item
• Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
• Positive definite completions of partial Hermitian matrices
• Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
• Schur products and matrix completions
• Hyper Markov laws in the statistical analysis of decomposable graphical models
• A characterization of Markov equivalence classes for acyclic digraphs
• Model uncertainty
• Sparse graphical models for exploring gene expression data
• Efficient Gaussian graphical model determination under \(G\)-Wishart prior distributions
• Experiments in stochastic computation for high-dimensional graphical models
• Bayesian graphical Lasso models and efficient posterior computation
• Bayesian Inference for General Gaussian Graphical Models With Application to Multivariate Lattice Data
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Decomposition of maximum likelihood in mixed graphical interaction models
• Linear Recursive Equations, Covariance Selection, and Path Analysis
• Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
• Decomposable graphical Gaussian model determination
• Cholesky decomposition of a hyper inverse Wishart matrix
• Fully dynamic algorithms for chordal graphs and split graphs
• The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
• Sampling decomposable graphs using a Markov chain on junction trees
• A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models