Introduces separable and essentially separable graphs as a broad class for mixed graphical models, provides multiple characterizations of the graphs and their separation equivalence, and develops an identification algorithm for equivalence classes.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces BRIDGE and SKFM algorithms that detect latent confounders via non-closing Lie brackets in interventional vector fields derived from density ratios.
citing papers explorer
-
Latent Confounded Causal Discovery via Lie Bracket Geometry
Introduces BRIDGE and SKFM algorithms that detect latent confounders via non-closing Lie brackets in interventional vector fields derived from density ratios.