A structural Markov property for decomposable graph laws that allows control of clique intersections

DOI10.1093/BIOMET/ASX072MaRDI QIDQ5384561zbMATH OpenOpenAlexFDO

Authors Alun Thomas, P. J. Green

Publication date 24 June 2019

Published in Biometrika (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1705.00554

zbMATH Keywords

conditional independencegraphical modelhub modelMarkov random fieldmodel determinationrandom graph

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10)

Cited in

(4)

• Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
• Graphical posterior predictive classification: Bayesian model averaging with particle Gibbs
• Parallel Sampling of Decomposable Graphs Using Markov Chains on Junction Trees
• Implementing a Metropolis sampler on decomposable graph distributions using a variety of graph representations that maintain decomposability

This page was built for publication: A structural Markov property for decomposable graph laws that allows control of clique intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384561)