The Exact Determinant of a Specific Class of Sparse Positive Definite Matrices
Not on the map. Why?
Abstract (arXiv)
For a specific class of sparse Gaussian graphical models, we provide a closed-form solution for the determinant of the covariance matrix. In our framework, the graphical interaction model (i.e., the covariance selection model) is equal to replacement product of Kn and Kn-1, where Kn is the complete graph with n vertices. Our analysis is based on taking the Fourier transform of the local factors of the model, which can be viewed as an application of the Normal Factor Graph Duality Theorem and holographic algorithms. The closed-form expression is obtained by applying the Matrix Determinant Lemma on the transformed graphical model. In this context, we will also define a notion of equivalence between two Gaussian graphical models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 29 references that are in the map. First posted on arXiv 11 Nov 2023.
Builds on
4 of 29 references.
References · 4
- 2015Large-scale Log-determinant Computation through Stochastic Chebyshev Expansionscited by 17
- 2015A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrixcited by 9
- 2017Codes on graphs: Models for elementary algebraic topology and statistical physicscited by 5
- 2021Duality for Continuous Graphical Modelscited by 1
Built on by
Not cited yet.