Positive Definite Completion Problems for Bayesian Networks

DOI10.1137/110861051zbMath1253.15038arXiv1201.0310OpenAlexW2009686967MaRDI QIDQ2910972

Emanuel Ben-David, Bala Rajaratnam

Publication date: 12 September 2012

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.0310

zbMATH Keywords

Bayesian networkspositive definite matricesdeterminantsdirected acyclic graphpartial matricesinversesperfect graphsCholesky decompositiondecomposable graphspositive definite completioninverse-covariance matrices

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Hermitian, skew-Hermitian, and related matrices (15B57) Directed graphs (digraphs), tournaments (05C20) Perfect graphs (05C17) Matrix completion problems (15A83)

Related Items (5)

Positive definite Hankel matrix completions and Hamburger moment completions ⋮ Critical exponents of graphs ⋮ The critical exponent: a novel graph invariant ⋮ On the Letac-Massam conjecture and existence of high dimensional Bayes estimators for graphical models ⋮ A review of Gaussian Markov models for conditional independence

This page was built for publication: Positive Definite Completion Problems for Bayesian Networks