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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Characterizing and Identifying Separable Graphical Models
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.