Volume 70, Issue 5

Graphical Gaussian models with edge and vertex symmetries

First published: 03 October 2008
Citations: 17
Steffen L. Lauritzen, Department of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK.
E‐mail: steffen@stats.ox.ac.uk

Abstract

Summary. We introduce new types of graphical Gaussian models by placing symmetry restrictions on the concentration or correlation matrix. The models can be represented by coloured graphs, where parameters that are associated with edges or vertices of the same colour are restricted to being identical. We study the properties of such models and derive the necessary algorithms for calculating maximum likelihood estimates. We identify conditions for restrictions on the concentration and correlation matrices being equivalent. This is for example the case when symmetries are generated by permutation of variable labels. For such models a particularly simple maximization of the likelihood function is available.

Number of times cited according to CrossRef: 17

  • Bayesian model selection approach for coloured graphical Gaussian models, Journal of Statistical Computation and Simulation, 10.1080/00949655.2020.1784175, (1-24), (2020).
  • , Statistical Modelling by Exponential Families, 10.1017/9781108604574, (2019).
  • Graph- and rule-based learning algorithms: a comprehensive review of their applications for cancer type classification and prognosis using genomic data, Briefings in Bioinformatics, 10.1093/bib/bby120, (2019).
  • Machine Learning and Rule Mining Techniques in the Study of Gene Inactivation and RNA Interference, Modulating Gene Expression - Abridging the RNAi and CRISPR-Cas9 Technologies [Working Title], 10.5772/intechopen.75144, (2018).
  • Bayesian precision and covariance matrix estimation for graphical Gaussian models with edge and vertex symmetries, Biometrika, 10.1093/biomet/asx084, 105, 2, (371-388), (2018).
  • Operational and financial performance of Italian airport companies: A dynamic graphical model, Transport Policy, 10.1016/j.tranpol.2016.09.004, 52, (231-237), (2016).
  • Model selection for factorial Gaussian graphical models with an application to dynamic regulatory networks, Statistical Applications in Genetics and Molecular Biology, 10.1515/sagmb-2014-0075, 15, 3, (2016).
  • Discriminant analysis with Gaussian graphical tree models, AStA Advances in Statistical Analysis, 10.1007/s10182-015-0256-6, 100, 2, (161-187), (2015).
  • Linear estimating equations for exponential families with application to Gaussian linear concentration models, Linear Algebra and its Applications, 10.1016/j.laa.2014.08.015, 473, (261-283), (2015).
  • Factorial graphical models for dynamic networks, Network Science, 10.1017/nws.2015.2, 3, 1, (37-57), (2015).
  • Estimation of Symmetry-Constrained Gaussian Graphical Models: Application to Clustered Dense Networks, Journal of Computational and Graphical Statistics, 10.1080/10618600.2014.937811, 24, 4, (909-929), (2015).
  • On the Geometry of Maximum Entropy Problems, SIAM Review, 10.1137/120862843, 55, 3, (415-439), (2013).
  • Fitting very large sparse Gaussian graphical models, Computational Statistics & Data Analysis, 10.1016/j.csda.2012.02.007, 56, 9, (2626-2636), (2012).
  • undefined, 2012 46th Annual Conference on Information Sciences and Systems (CISS), 10.1109/CISS.2012.6310765, (1-6), (2012).
  • Matrix Completion à la Dempster by the Principle of Parsimony, IEEE Transactions on Information Theory, 10.1109/TIT.2011.2143970, 57, 6, (3925-3931), (2011).
  • Lattices of Graphical Gaussian Models with Symmetries, Symmetry, 10.3390/sym3030653, 3, 3, (653-679), (2011).
  • Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry, Annals of the Institute of Statistical Mathematics, 10.1007/s10463-010-0295-4, 62, 4, (603-638), (2010).