Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5769726 (Why is no real title available?)
- scientific article; zbMATH DE number 1222286 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- A Metropolis-Hastings based method for sampling from the \(G\)-Wishart distribution in Gaussian graphical models
- A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models
- A structural Markov property for decomposable graph laws that allows control of clique intersections
- A theorem on trees.
- Accelerating Bayesian Structure Learning in Sparse Gaussian Graphical Models
- Bayesian clustering in decomposable graphs
- Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
- Counting labelled chordal graphs
- Decomposable graphical Gaussian model determination
- Decomposition of maximum likelihood in mixed graphical interaction models
- Exact formulas for the normalizing constants of Wishart distributions for graphical models
- Experiments in stochastic computation for high-dimensional graphical models
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Irreversible Langevin samplers and variance reduction: a large deviations approach
- MCMC model determination for discrete graphical models
- Monte Carlo sampling methods using Markov chains and their applications
- Non-reversible Metropolis-Hastings
- Partial balance and insensitivity
- Sampling decomposable graphs using a Markov chain on junction trees
- Sequential sampling of junction trees for decomposable graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Simulation of hyper-inverse Wishart distributions for non-decomposable graphs
- Structural Markov graph laws for Bayesian model uncertainty
- Variance reduction using nonreversible Langevin samplers
This page was built for publication: Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970800)
