Faithfulness in chain graphs: the discrete case

DOI10.1016/J.IJAR.2009.06.006MaRDI QIDQ962944zbMATH OpenOpenAlexFDO

Authors Jose M. Peña

Publication date 7 April 2010

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2009.06.006

zbMATH Keywords

chain graphsfaithfulnessMarkov equivalencefactorization equivalencelargest chain graphs

Mathematics Subject Classification ID

Multivariate analysis (62H99) Applications of graph theory (05C90) Measures of association (correlation, canonical correlation, etc.) (62H20)

Recommendations

• Faithfulness and learning hypergraphs from discrete distributions
• Publication:3490019
• Faithfulness of probability distributions and graphs
• Counterexamples to conjectures for uniformly optimally reliable graphs.
• Reliabilities of Consecutive-2 Graphs
• Integrity of total graphs via certain parameters
• On an Invariant of Graphs and the Reliability Polynomial
• Faithful 1-edge fault tolerant graphs
• Implications of faithfulness in graphical models
• Chain graph interpretations and their relations revisited

Cites work

• scientific article; zbMATH DE number 4174001 (Why is no real title available?)
• scientific article; zbMATH DE number 3513115 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
• Distinctness of the eigenvalues of a quadratic form in a multivariate sample
• On chain graph models for description of conditional independence structures
• Two operations of merging and splitting components in a chain graph

Cited in

(7)

• Properties of separation procedures for discrete objects in Bayesian network models
• Faithfulness and learning hypergraphs from discrete distributions
• Marginalization and conditioning for LWF chain graphs
• Qualitative chain graphs and their application
• Every LWF and AMP chain graph originates from a set of causal models
• A note on faithfulness and total positivity
• Faithfulness of probability distributions and graphs

This page was built for publication: Faithfulness in chain graphs: the discrete case

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