## Hyper and structural Markov laws for graphical models

##### View / Open Files

##### Authors

Byrne, Simon

##### Advisors

Dawid, A. Philip

##### Date

2012-03-06##### Awarding Institution

University of Cambridge

##### Author Affiliation

Department of Pure Mathematics and Mathematical Statistics

##### Qualification

PhD

##### Language

English

##### Type

Thesis

##### Metadata

Show full item record##### Citation

Byrne, S. (2012). Hyper and structural Markov laws for graphical models (doctoral thesis).

##### Abstract

My thesis focuses on the parameterisation and estimation of graphical models, based on the concept of hyper and meta Markov properties. These state that the parameters should exhibit conditional independencies, similar to those on the sample space. When these properties are satisfied, parameter estimation may be performed locally, i.e. the estimators for certain subsets of the graph are determined entirely by the data corresponding to the subset.
Firstly, I discuss the applications of these properties to the analysis of case-control studies. It has long been established that the maximum likelihood estimates for the odds-ratio may be found by logistic regression, in other words, the "incorrect" prospective model is equivalent to the correct retrospective model. I use a generalisation of the hyper Markov properties to identify necessary and sufficient conditions for the corresponding result in a Bayesian analysis, that is, the posterior distribution for the odds-ratio is the same under both the prospective and retrospective likelihoods. These conditions can be used to derive a parametric family of prior laws that may be used for such an analysis.
The second part focuses on the problem of inferring the structure of the underlying graph. I propose an extension of the meta and hyper Markov properties, which I term structural Markov properties, for both undirected decomposable graphs and directed acyclic graphs. Roughly speaking, it requires that the structure of distinct components of the graph are conditionally independent given the existence of a separating component. This allows the analysis and comparison of multiple graphical structures, while being able to take advantage of the common conditional independence constraints. Moreover, I show that these properties characterise exponential families, which form conjugate priors under sampling from compatible Markov distributions.

##### Identifiers

This record's URL: http://www.dspace.cam.ac.uk/handle/1810/242185

##### Rights

Attribution-NoDerivs 2.0 UK: England & Wales

Licence URL: http://creativecommons.org/licenses/by-nd/2.0/uk/

## Recommended or similar items

The following licence files are associated with this item: