Strong Completeness and Faithfulness in Bayesian Networks
arXiv:1302.4973
Abstract
A completeness result for d-separation applied to discrete Bayesian networks is presented and it is shown that in a strong measure-theoretic sense almost all discrete distributions for a given network structure are faithful; i.e. the independence facts true of the distribution are all and only those entailed by the network structure.
Appears in Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI1995)
Cited by in corpus (10)
- Causal Inference in the Presence of Latent Variables and Selection Bias
- Strong Faithfulness and Uniform Consistency in Causal Inference
- Quantifier Elimination for Statistical Problems
- On causally asymmetric versions of Occam's Razor and their relation to thermodynamics
- Causal inference using the algorithmic Markov condition
- Causal Conclusions that Flip Repeatedly and Their Justification
- Practically Perfect
- Using the structure of d-connecting paths as a qualitative measure of the strength of dependence
- Identifying the Relevant Nodes Without Learning the Model
- Reading Dependencies from Polytree-Like Bayesian Networks