Self-adhesivity in lattices of abstract conditional independence models

DOI10.1016/J.DAM.2024.10.006MaRDI QIDQ6657229zbMATH OpenFDO

Authors Tobias Boege, Janneke H. Bolt, Milan Studený

Publication date 6 January 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2024.10.006

zbMATH Keywords

Boolean satisfiabilityconditional independencelattice order theorypseudo-closed elementself-adhesivitysemi-graphoid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Statistical aspects of information-theoretic topics (62B10) Combinatorial optimization (90C27) Information theory (general) (94A15)

Recommendations

• Selfadhesivity in Gaussian conditional independence structures
• On the conditional independence implication problem: a lattice-theoretic approach
• A computational algebraic-geometry method for conditional-independence inference
• Conditional independence structure and its closure: inferential rules and algorithms
• On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs

Cites work

• A non-Shannon-type conditional inequality of information quantities
• Abstract functional dependency structures
• Adhesivity of polymatroids
• Book Inequalities
• Computational Complexity
• Conceptual exploration
• Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities
• Conditional Independences among Four Random Variables I
• Conditional Independences among Four Random Variables II
• Conditional Information Inequalities for Entropic and Almost Entropic Points
• Core-based criterion for extreme supermodular functions
• Enumerating maximal consistent closed sets in closure systems
• Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
• Generalized rules of probabilistic independence
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 176091 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Implementing efficient All solutions SAT solvers
• Information theory and network coding
• Lengths of semigraphoid inferences
• Logical and algorithmic properties of conditional independence and graphical models
• Markov properties for mixed graphs
• On characterization of entropy function via information inequalities
• On Gaussian conditional independence structures
• On sentences which are true of direct unions of algebras
• On the complexity of enumerating pseudo-intents
• One-adhesive polymatroids.
• Proving information inequalities and identities with symbolic computation
• Selfadhesivity in Gaussian conditional independence structures
• STRUCTURAL SEMIGRAPHOIDS¹
• Submodular functions and optimization.
• The geometry of gaussoids
• Three Counter-Examples on Semi-Graphoids
• Towards classification of semigraphoids.
• Two generalizations of the semi-graphoid rule of probabilistic independence and more

Cited in

(1)

• Selfadhesivity in Gaussian conditional independence structures

This page was built for publication: Self-adhesivity in lattices of abstract conditional independence models

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