Towards classification of semigraphoids.

DOI10.1016/S0012-365X(03)00155-9zbMATH Open1059.68082MaRDI QIDQ1426115FDOQ1426115

Authors: František Matúš 

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• STRUCTURAL SEMIGRAPHOIDS¹
• Semigraphs
• Enumeration of semigraphs
• scientific article; zbMATH DE number 2015515
• Semigroup as graphs
• Rees semigroups of digraphs for classification of data.
• scientific article; zbMATH DE number 3898926
• A class of semisymmetric graphs
• Semi-graphs of anabelioids

zbMATH Keywords

ClosureGeneratorConditional independenceLinear representationPolymatroidProbabilistic representationSemigraphoid

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logical and algorithmic properties of conditional independence and graphical models
• Title not available (Why is that?)
• Semigraphoids and structures of probabilistic conditional independence
• On chain graph models for description of conditional independence structures
• Conditional Independences among Four Random Variables I
• Lengths of semigraphoid inferences
• Separoids: a mathematical framework for conditional independence and irrelevance
• Conditional Independences among Four Random Variables III: Final Conclusion
• STRUCTURAL SEMIGRAPHOIDS¹
• Stochastic independence, causal independence, and shieldability
• Lattice models for conditional independence in a multivariate normal distribution
• Markov properties of nonrecursive causal models
• Title not available (Why is that?)
• PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND¹
• Conditional independence structures examined via minors
• Conditional Independences among Four Random Variables II
• Title not available (Why is that?)
• On equivalence of Markov properties over undirected graphs
• On the Axiomization of Conditional Independence

Cited In (10)

• Lengths of semigraphoid inferences
• Contribution of František Matúš to the research on conditional independence.
• Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
• Selfadhesivity in Gaussian conditional independence structures
• Three Counter-Examples on Semi-Graphoids
• Properties of semi-elementary imsets as sums of elementary imsets
• Decomposition of two classes of structural models
• Self-adhesivity in lattices of abstract conditional independence models
• On Gaussian conditional independence structures
• A computational algebraic-geometry method for conditional-independence inference

This page was built for publication: Towards classification of semigraphoids.

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