A parameterization of positive definite matrices in terms of partial correlation vines (Q1410721): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q56865721, #quickstatements; #temporary_batch_1718109305272
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4514034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts, matrix completions and graph rigidity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive semidefinite completion problem for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive definite completions of partial Hermitian matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vines -- a new graphical model for dependent random variables. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive definite completion problem: cycle completability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive definite completion problem for a simple cycle / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56865721 / rank
 
Normal rank

Latest revision as of 14:37, 11 June 2024

scientific article
Language Label Description Also known as
English
A parameterization of positive definite matrices in terms of partial correlation vines
scientific article

    Statements

    A parameterization of positive definite matrices in terms of partial correlation vines (English)
    0 references
    0 references
    0 references
    15 October 2003
    0 references
    This paper extends a method of the authors for studying positive definiteness by interpreting a symmetric matrix as a potential correlation matrix, and using their theory of partial correlations with a new theory called vines. Vines are sequences of trees such that the nodes of each tree are the edges of the previous tree; their edges are associated with partial correlations. Positive definiteness can be determined by computing partial correlations on a regular vine and seeing if they are in \((-1,1)\). This also provides a method of adjusting non-positive definite matrices so that they become positive definite.
    0 references
    correlation
    0 references
    tree dependence
    0 references
    positive definite matrix
    0 references
    matrix completion
    0 references
    vine
    0 references
    partial correlation
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references