Self-adhesivity in lattices of abstract conditional independence models
DOI10.1016/J.DAM.2024.10.006MaRDI QIDQ6657229FDOQ6657229
Authors: Tobias Boege, Janneke H. Bolt, Milan Studený 
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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
conditional independenceBoolean satisfiabilitysemi-graphoidself-adhesivitylattice order theorypseudo-closed element
Statistical aspects of information-theoretic topics (62B10) Combinatorial optimization (90C27) Information theory (general) (94A15) Combinatorial aspects of matroids and geometric lattices (05B35)
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?)
- Computational Complexity
- Title not available (Why is that?)
- Logical and algorithmic properties of conditional independence and graphical models
- Submodular functions and optimization.
- Generalized rules of probabilistic independence
- Core-based criterion for extreme supermodular functions
- On characterization of entropy function via information inequalities
- Information theory and network coding
- On sentences which are true of direct unions of algebras
- Markov properties for mixed graphs
- On Gaussian conditional independence structures
- Conditional Independences among Four Random Variables I
- A non-Shannon-type conditional inequality of information quantities
- Towards classification of semigraphoids.
- Lengths of semigraphoid inferences
- Three Counter-Examples on Semi-Graphoids
- STRUCTURAL SEMIGRAPHOIDS1
- Title not available (Why is that?)
- On the complexity of enumerating pseudo-intents
- Adhesivity of polymatroids
- Abstract functional dependency structures
- Enumerating maximal consistent closed sets in closure systems
- Title not available (Why is that?)
- Conditional Independences among Four Random Variables II
- Conceptual exploration
- The geometry of gaussoids
- Book Inequalities
- Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
- Implementing efficient All solutions SAT solvers
- Two generalizations of the semi-graphoid rule of probabilistic independence and more
- Conditional Information Inequalities for Entropic and Almost Entropic Points
- Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities
- One-adhesive polymatroids.
- Selfadhesivity in Gaussian conditional independence structures
- Proving information inequalities and identities with symbolic computation
Cited In (1)
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)
