Lattices of Graphical Gaussian Models with Symmetries
AbstractIn order to make graphical Gaussian models a viable modelling tool when the number of variables outgrows the number of observations,  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 . 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Gehrmann, H. Lattices of Graphical Gaussian Models with Symmetries. Symmetry 2011, 3, 653-679.
Gehrmann H. Lattices of Graphical Gaussian Models with Symmetries. Symmetry. 2011; 3(3):653-679.Chicago/Turabian Style
Gehrmann, Helene. 2011. "Lattices of Graphical Gaussian Models with Symmetries." Symmetry 3, no. 3: 653-679.