A graphical characterization of the largest chain graphs
From MaRDI portal
Publication:1807602
DOI10.1016/S0888-613X(99)00003-1zbMath0935.62063MaRDI QIDQ1807602
Publication date: 8 May 2000
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Characterization and structure theory for multivariate probability distributions; copulas (62H05) Structural characterization of families of graphs (05C75)
Related Items
Markov equivalence of marginalized local independence graphs, Unnamed Item, CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS, Formulas for counting acyclic digraph Markov equivalence classes, Characterizing Markov equivalence classes for AMP chain graph models, A scoring criterion for learning chain graphs, On chain graph models for description of conditional independence structures, A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs, Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs, On Block Ordering of Variables in Graphical Modelling, The size distribution for Markov equivalence classes of acyclic digraph models., Chain graph interpretations and their relations revisited
Cites Work
- BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- On chain graph models for description of conditional independence structures
- A recovery algorithm for chain graphs
- Alternative Markov Properties for Chain Graphs
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
