On Block Ordering of Variables in Graphical Modelling

DOI10.1111/J.1467-9469.2006.00478.XzbMATH Open1124.60021OpenAlexW2129278834MaRDI QIDQ3411060FDOQ3411060

Authors: Alberto Roverato, Luca La Rocca 

Publication date: 8 December 2006

Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9469.2006.00478.x

Recommendations

• Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• Publication:3198595
• Marginalization and conditioning for LWF chain graphs
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

zbMATH Keywords

chain graphessential graphLauritzen-Wermuth-Frydenberg Markov property

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Markov processes (60J99) Distribution theory (60E99)

Cites Work

• Causation, prediction, and search
• Introduction to Graphical Modelling
• A characterization of Markov equivalence classes for acyclic digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 10.1162/153244302760200696
• Model selection for Gaussian concentration graphs
• Probabilistic Networks and Expert Systems
• Chain Graph Models and their Causal Interpretations
• Title not available (Why is that?)
• Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
• Decomposable graphical Gaussian model determination
• A graphical characterization of the largest chain graphs
• Miscellanea. On the generation of the chordless four-cycle
• A recovery algorithm for chain graphs
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS

Cited In (2)

• AMP chain graphs: minimal separators and structure learning algorithms
• Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs

Uses Software

• MIM

This page was built for publication: On Block Ordering of Variables in Graphical Modelling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3411060)