Completion problem with partial correlation vines
DOI10.1016/j.laa.2006.01.031zbMath1106.15011OpenAlexW1965115537WikidataQ56865722 ScholiaQ56865722MaRDI QIDQ852640
Dorota Kurowicka, Roger M. Cooke
Publication date: 15 November 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.01.031
correlationgraphsfactorizationpartial matrixpositive definite matrixchordal graphscompletion problemmaximal determinantregular vinepartial correlation vineproto correlation matrix
Measures of association (correlation, canonical correlation, etc.) (62H20) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (20)
Cites Work
- The real positive semidefinite completion problem for series-parallel graphs
- Positive definite completions of partial Hermitian matrices
- The real positive definite completion problem for a simple cycle
- An interior-point method for approximate positive semidefinite completions
- A parameterization of positive definite matrices in terms of partial correlation vines
- Determinantal formulae for matrix completions associated with chordal graphs
- Vines -- a new graphical model for dependent random variables.
- Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
- Probabilistic Networks and Expert Systems
This page was built for publication: Completion problem with partial correlation vines