Characterizing and Identifying Separable Graphical Models
Christopher Meek, Kayvan Sadeghi
stat.ML, cs.LG, math.ST
Submitted: 2026-07-01
Comments: 69 pages, 7 figures, complete paper currently under submission
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Establishing Markov Equivalence in Cyclic Directed Graphs
- Learning Sparse Causal Models is not NP-hard
- Causal Calculus in the Presence of Cycles, Latent Confounders and Selection Bias
- Causal Inference and Causal Explanation with Background Knowledge
- Strong Completeness and Faithfulness in Bayesian Networks
- A Discovery Algorithm for Directed Cyclic Graphs
- Faithfulness of Probability Distributions and Graphs
- Directed Cyclic Graphical Representations of Feedback Models
- On the Equivalence of Causal Models
- A Characterization of Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables
Related papers
- Behavior of prediction performance metrics with rare events
- Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
- A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
- Scalable Posterior Uncertainty for Flexible Density-Based Clustering
- A Transport Geometry of Benign Overfitting
- Efficient quadratic entropy with distance sketches