In order to make graphical Gaussian models a viable modelling tool when the number of variables outgrows the number of observations, [1] introduced model classes which place equality restrictions on concentrations or partial correlations. The models can be represented by vertex and edge coloured graphs. The need for model selection methods makes it imperative to understand the structure of model classes. We identify four model classes that form complete lattices of models with respect to model inclusion, which qualifies them for an Edwards-Havránek model selection procedure [2]. Two classes turn out most suitable for a corresponding model search. We obtain an explicit search algorithm for one of them and provide a model search example for the other.
We study the problem of estimability of means in undirected graphical
Gaussian models with symmetry restrictions represented by a colored graph.
Following on from previous studies, we partition the variables into sets of
vertices whose corresponding means are restricted to being identical. We find a
necessary and sufficient condition on the partition to ensure equality between
the maximum likelihood and least-squares estimators of the mean.Comment: Published in at http://dx.doi.org/10.1214/12-AOS991 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.