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

• 成果类型: Article
• 署名作者: Green, Peter J.; Thomas, Alun
• 署名单位: University of Technology Sydney; Utah System of Higher Education; University of Utah
• 刊物名称: BIOMETRIKA
• ISSN/ISSBN: 0006-3444
• DOI: 10.1093/biomet/asx072
• 发表日期: 2018
• 页码: 1929
• 关键词: models

摘要

We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques and so is capable of encoding some interesting structure. We prove the equivalence of this property to an exponential family assumption, and discuss identifiability, modelling, inferential and computational implications.