Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs
From MaRDI portal
Publication:2084724
Recommendations
- Correlation matrices of Gaussian Markov random fields over cycle graphs
- Gaussian Markov distributions over finite graphs
- Conditional-mean least-squares fitting of Gaussian Markov random fields to Gaussian fields
- Multi-dimensional multivariate Gaussian Markov random fields with application to image processing
- Maximum likelihood and restricted maximum likelihood estimation for a class of Gaussian Markov random fields
Cites work
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Atoms and clique separators in graph products
- Decomposition by clique separators
- Gaussian Markov Random Fields
- Gaussian Markov distributions over finite graphs
- Graphs, algorithms, and optimization
- Iterative Proportional Scaling Revisited: A Modern Optimization Perspective
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Positive definite completions of partial Hermitian matrices
- Revisiting decomposition by clique separators
- Sample Efficient Toeplitz Covariance Estimation
- Some recent work on multivariate Gaussian Markov random fields
- Statistical Analysis of Stochastic Processes in Time
Cited in
(5)- Gaussian Markov random fields over graphs of paths and high relative accuracy
- Correlation matrices of Gaussian Markov random fields over cycle graphs
- Algebraic representations of Gaussian Markov combinations
- Conditional-mean least-squares fitting of Gaussian Markov random fields to Gaussian fields
- Gaussian Markov random fields and totally positive matrices
This page was built for publication: Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084724)
