Hyper Markov law in undirected graphical models with its applications

Xiong Kang and Brian Yi Sun

Communications in Statistics - Theory and Methods, 2024, vol. 53, issue 20, 7262-7280

Abstract: By exploring the prime decomposition of undirected graphs, this work investigates the hyper Markov property within the framework of arbitrary undirected graph, which can be seen as the generalization of that for decomposable graphical models proposed by Dawid and Laurizten. The proposed hyper Markov properties of this article can be used to characterize the conditional independence of a distribution or a statistical quantity and helpful to simplify the likelihood ratio functions for statistical test for two different graphs obtained by removing or adding one edge. As an application of these properties, the G-Wishart law is introduced as a prior law for graphical Gaussian models for Bayesian posterior updating, and a hypothesis test for precision matrix is designed to determine the model structures. Our simulation experiments are implemented by using the Gibbs Sampler algorithm and the results show that it performs better in convergence speed.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2023.2263111 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:53:y:2024:i:20:p:7262-7280

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2023.2263111

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().