Logical and algorithmic properties of conditional independence and graphical models
From MaRDI portal
Publication:1317261
DOI10.1214/aos/1176349407zbMath0814.62006OpenAlexW2038254774WikidataQ60306866 ScholiaQ60306866MaRDI QIDQ1317261
Publication date: 18 June 1995
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176349407
graphical modelsconditional independenceMarkov networksMarkov fieldsaxiomatic basisunconditional independencegraph separationbinary factorizations of strictly positive probability models
Random fields (60G60) Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Foundations of probability theory (60A99) Axioms; other general questions in probability (60A05)
Related Items
Learning causal Bayesian networks using minimum free energy principle ⋮ On the finite and general implication problems of independence atoms and keys ⋮ Conditional independence in valuation-based systems ⋮ An axiomatic framework for propagating uncertainty in directed acyclic networks ⋮ Category-theoretic structure for independence and conditional independence ⋮ A complete axiomatization of full acyclic join dependencies ⋮ Concise representations and construction algorithms for semi-graphoid independency models ⋮ Conditional independence and natural conditional functions ⋮ Gaussoids are two-antecedental approximations of Gaussian conditional independence structures ⋮ Logical and algorithmic properties of independence and their application to Bayesian networks ⋮ Causality, Conditional Independence, and Graphical Separation in Settable Systems ⋮ Determining full conditional independence by low-order conditioning ⋮ DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1 ⋮ Integrating Bayesian networks and decision trees in a sequential rule-based transportation model ⋮ Interventionist decision theory ⋮ Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty ⋮ Towards classification of semigraphoids. ⋮ Unnamed Item ⋮ A note on faithfulness and total positivity ⋮ Multigraded commutative algebra of graph decompositions ⋮ On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements ⋮ Exploiting independencies to compute semigraphoid and graphoid structures ⋮ Logical and algorithmic properties of stable conditional independence ⋮ On the toric algebra of graphical models ⋮ Mutual conditional independence and its applications to model selection in Markov networks ⋮ Racing algorithms for conditional independence inference ⋮ Decomposition of two classes of structural models ⋮ Standard imsets for undirected and chain graphical models ⋮ Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data ⋮ On chain graph models for description of conditional independence structures ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ A review of Gaussian Markov models for conditional independence ⋮ A recovery algorithm for chain graphs ⋮ Near-exact distributions for the likelihood ratio test statistic for testing multisample independence -- the real and complex cases ⋮ Contribution of Frantisek Matus to the research on conditional independence ⋮ Characterisation of conditional independence structures for polymatroids using vanishing sets ⋮ Abstract functional dependency structures
