Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs

DOI10.1007/s11749-022-00804-3OpenAlexW4213419504MaRDI QIDQ2084724

Susana Montes, Juan Baz, Raúl Pérez-Fernández, Irene Díaz

Publication date: 13 October 2022

Published in: Test (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11749-022-00804-3

zbMATH Keywords

graph theorycovariance matrixGaussian Markov random fieldmultivariate Gaussian Markov random field

Mathematics Subject Classification ID

Random fields (60G60)

Related Items

Correlation matrices of Gaussian Markov random fields over cycle graphs

Uses Software

• GMRFLib

Cites Work

• Unnamed Item
• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• Decomposition by clique separators
• Gaussian Markov distributions over finite graphs
• Some recent work on multivariate Gaussian Markov random fields
• Graphs, Algorithms, and Optimization
• Atoms and clique separators in graph products
• Iterative Proportional Scaling Revisited: A Modern Optimization Perspective
• Algorithmic Aspects of Vertex Elimination on Graphs
• Revisiting Decomposition by Clique Separators
• Gaussian Markov Random Fields
• Statistical Analysis of Stochastic Processes in Time
• Sample Efficient Toeplitz Covariance Estimation