Alternative Markov properties for chain graphs
An alternative Markov property (AMP) for chain graphs (CGs) is introduced and shown to be the Markov property satisfied by a block-recursive linear system with multivariate normal errors. This study has been started by the authors [in: Uncertainty in artificial intelligence: Proceedings of the twelfth conference (eds. F. Jensen and E. Horvitz), 40-48 (1996)]. For a CG that is either an undirected graph (UG) or an acyclic directed graph (ADG), the Lauritzen-Wermuth-Frydenberg (LWF) [see \textit{S. L. Lauritzen} and \textit{N. Wermuth}, Ann. Stat. 17, No. 1, 31-57 (1989; Zbl 0669.62045); \textit{M. Frydenberg}, Scand. J. Stat. 17, No. 4, 333-353 (1990; Zbl 0713.60013)] and AMP Markov properties coincide. We note that LWF is the Markov property for adicyclic graphs, ``chain graphs that generalize the classical Markov properties for both UGs and ADGs. For a general CG the AMP in some ways seems to be a more direct extension of the ADG Markov property than does the LWF property. In the general case, necessary and sufficient conditions are given for the equivalence of the LWF and AMP Markov properties of a CG, for the AMP Markov equivalence of two CGs, for the AMP Markov equivalence of a CG to some ADG or decomposable UG, and for other equivalences. For CGs, in some ways the AMP property is a more direct extension of the ADG Markov property than is the LWF property.
- Characterizing Markov equivalence classes for AMP chain graph models
- scientific article; zbMATH DE number 4174001
- Marginal AMP chain graphs
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
- Separation and completeness properties for AMP chain graph Markov models.
- Minimal sufficient causation and directed acyclic graphs
- Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
- Causal effect identification in acyclic directed mixed graphs and gated models
- Wishart distributions on homogeneous cones
- Unifying Markov properties for graphical models
- A graphical characterization of the largest chain graphs
- Separation and completeness properties for AMP chain graph Markov models.
- Ancestral graph Markov models.
- Sequences of regressions and their independences
- On a hypergraph probabilistic graphical model
- High-dimensional structure learning of sparse vector autoregressive models using fractional marginal pseudo-likelihood
- Customized structural elicitation
- Bayesian graphical models for modern biological applications
- Equivalence class selection of categorical graphical models
- On Riesz and Wishart distributions associated with decomposable undirected graphs
- Objective Bayes model selection of Gaussian interventional essential graphs for the identification of signaling pathways
- A review of Gaussian Markov models for conditional independence
- Chain graph interpretations and their relations revisited
- A likelihood ratio test for equality of natural parameters for generalized Riesz distributions
- Qualitative chain graphs and their application
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Marginal AMP chain graphs
- Markov properties for mixed graphs
- Computing all roots of the likelihood equations of seemingly unrelated regressions
- A SINful approach to Gaussian graphical model selection
- Characterizing Markov equivalence classes for AMP chain graph models
- Marginalization and conditioning for LWF chain graphs
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
- Every LWF and AMP chain graph originates from a set of causal models
- Factorization, inference and parameter learning in discrete AMP chain graphs
- Two operations of merging and splitting components in a chain graph
- Monotone dependence in graphical models for multivariate Markov chains
- Graphical models for multivariate Markov chains
- Graphical modelling of multivariate time series
- Multiple testing and error control in Gaussian graphical model selection
- Faithfulness of probability distributions and graphs
- Markovian acyclic directed mixed graphs for discrete data
- Chain Graph Models and their Causal Interpretations
- Bayesian Structure Learning in Multilayered Genomic Networks
- AMP chain graphs: minimal separators and structure learning algorithms
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
- Temporal aggregation in chain graph models
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
- Discrete chain graph models
- Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
- Properties of graphical regression models for multidimensional categorical data
- Chain graph models of multivariate regression type for categorical data
- Bayesian sample size determination for causal discovery
- Bayesian learning of multiple directed networks from observational data
- Identifiability and Consistent Estimation for Gaussian Chain Graph Models
- Mixed orthogonality graphs for continuous-time stationary processes
- Bayesian robust learning in chain graph models for integrative pharmacogenomics
- Weak equivalence of local independence graphs
- Bayesian multilayered mediation analysis for cancer pharmacogenomics
- Regression graphs and sparsity-inducing reparameterizations
- Partial inversion for linear systems and partial closure of independence graphs
- On expressiveness of the chain graph interpretations
- Learning marginal AMP chain graphs under faithfulness revisited
- Trek separation for Gaussian graphical models
- Racing algorithms for conditional independence inference
This page was built for publication: Alternative Markov properties for chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2722302)
