Automorphism groups of Gaussian chain graph models
From MaRDI portal
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Robustness and adaptive procedures (parametric inference) (62F35) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Multivariate analysis (62H99)
Abstract: In this paper we extend earlier work on groups acting on Gaussian graphical models to Gaussian Bayesian networks and more general Gaussian models defined by chain graphs. We discuss the maximal group which leaves a given model invariant and provide basic statistical applications of this result. This includes equivariant estimation, maximal invariants and robustness. The computation of the group requires finding the essential graph. However, by applying Studeny's theory of imsets we show that computations for DAGs can be performed efficiently without building the essential graph. In our proof we derive simple necessary and sufficient conditions on vanishing sub-minors of the concentration matrix in the model.
This page was built for publication: Automorphism groups of Gaussian chain graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258080)
