Some results on the Gaussian Markov Random Field construction problem based on the use of invariant subgraphs

• Juan Baz ^[1] ; Irene Díaz ^[1] ; Susana Montes ^[1] ; Raúl Pérez-Fernández ^[1]
  1. [1] Universidad de Oviedo

     Universidad de Oviedo

     Oviedo, España

     
• Localización: Test: An Official Journal of the Spanish Society of Statistics and Operations Research, ISSN-e 1863-8260, ISSN 1133-0686, Vol. 31, Nº. 3, 2022, págs. 856-874
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • The study of Gaussian Markov Random Fields has attracted the attention of a large number of scientific areas due to its increasing usage in several fields of application. Here, we consider the construction of Gaussian Markov Random Fields from a graph and a positive-definite matrix, which is closely related to the problem of finding the Maximum Likelihood Estimator of the covariance matrix of the underlying distribution. In particular, it is simultaneously required that the variances and the covariances between variables associated with adjacent nodes in the graph are fixed by the positive-definite matrix and that pairs of variables associated with non-adjacent nodes in the graph are conditionally independent given all other variables. The solution to this construction problem exists and is unique up to the choice of a vector of means. In this paper, some results focusing on a certain type of subgraphs (invariant subgraphs) and a representation of the Gaussian Markov Random Field as a Multivariate Gaussian Markov Random Field are presented. These results ease the computation of the solution to the aforementioned construction problem.