On association models defined over independence graphs

DOI10.2307/3318662MaRDI QIDQ1283378zbMATH OpenOpenAlexFDO

Authors Nanny Wermuth, D. R. Cox

Publication date 1998

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.bj/1173883817

zbMATH Keywords

conditional independencedecompositiongraphical Markov modelquasi-linear dependenceseparation criteriatriangular matrix

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Applications of graph theory (05C90) Measures of association (correlation, canonical correlation, etc.) (62H20)

Recommendations

• scientific article; zbMATH DE number 802837
• Ancestral graph Markov models.
• Joint Response Graphs and Separation Induced by Triangular Systems
• Probability distributions with summary graph structure
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS

Cited in

(14)

• The L-separation criterion for description of cs-independence models
• Unifying Markov properties for graphical models
• Sequences of regressions and their independences
• Triangular systems for symmetric binary variables
• Latent association graph inference for binary transaction data
• Markov properties for mixed graphs
• Faithfulness of probability distributions and graphs
• Joint Response Graphs and Separation Induced by Triangular Systems
• scientific article; zbMATH DE number 802837 (Why is no real title available?)
• Mixed-effect models with trees
• An evolutionary estimation procedure for generalized semilinear regression trees
• Probability distributions with summary graph structure
• Partial inversion for linear systems and partial closure of independence graphs
• Covariance chains

This page was built for publication: On association models defined over independence graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283378)