On association models defined over independence graphs

DOI10.2307/3318662zbMATH Open1037.62054OpenAlexW2163362757MaRDI QIDQ1283378FDOQ1283378

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

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

zbMATH Keywords

decompositionconditional independencetriangular matrixgraphical Markov modelseparation criteriaquasi-linear dependence

Mathematics Subject Classification ID

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

Cited In (13)

• An evolutionary estimation procedure for generalized semilinear regression trees
• Unifying Markov properties for graphical models
• Latent association graph inference for binary transaction data
• Joint Response Graphs and Separation Induced by Triangular Systems
• The L-separation criterion for description of cs-independence models
• Partial inversion for linear systems and partial closure of independence graphs
• Mixed-effect models with trees
• Sequences of regressions and their independences
• Faithfulness of Probability Distributions and Graphs
• Triangular systems for symmetric binary variables
• Probability distributions with summary graph structure
• Markov properties for mixed 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)