Self-adhesivity in lattices of abstract conditional independence models

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

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?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Core-based criterion for extreme supermodular functions
On the complexity of enumerating pseudo-intents
Abstract functional dependency structures
Logical and algorithmic properties of conditional independence and graphical models
Towards classification of semigraphoids.
Lengths of semigraphoid inferences
Enumerating maximal consistent closed sets in closure systems
Generalized rules of probabilistic independence
Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
The geometry of gaussoids
Markov properties for mixed graphs
Adhesivity of polymatroids
Submodular functions and optimization.
Conceptual Exploration
Book Inequalities
Three Counter-Examples on Semi-Graphoids
STRUCTURAL SEMIGRAPHOIDS¹
A non-Shannon-type conditional inequality of information quantities
On characterization of entropy function via information inequalities
Conditional Independences among Four Random Variables I
Conditional Independences among Four Random Variables II
Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities
Implementing Efficient All Solutions SAT Solvers
Computational Complexity
Conditional Information Inequalities for Entropic and Almost Entropic Points
On sentences which are true of direct unions of algebras
One-adhesive polymatroids
Selfadhesivity in Gaussian conditional independence structures
Two generalizations of the semi-graphoid rule of probabilistic independence and more
Proving information inequalities and identities with symbolic computation

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)