Discrete chain graph models
From MaRDI portal
Abstract: The statistical literature discusses different types of Markov properties for chain graphs that lead to four possible classes of chain graph Markov models. The different models are rather well understood when the observations are continuous and multivariate normal, and it is also known that one model class, referred to as models of LWF (Lauritzen--Wermuth--Frydenberg) or block concentration type, yields discrete models for categorical data that are smooth. This paper considers the structural properties of the discrete models based on the three alternative Markov properties. It is shown by example that two of the alternative Markov properties can lead to non-smooth models. The remaining model class, which can be viewed as a discrete version of multivariate regressions, is proven to comprise only smooth models. The proof employs a simple change of coordinates that also reveals that the model's likelihood function is unimodal if the chain components of the graph are complete sets.
Recommendations
Cites work
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 1055955 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 922429 (Why is no real title available?)
- A NOTE ON MULTIVARIATE LOGISTIC MODELS FOR CONTINGENCY TABLES
- A SINful approach to Gaussian graphical model selection
- Algebraic Statistics for Computational Biology
- Algebraic statistical models
- Alternative Markov properties for chain graphs
- Ancestral graph Markov models.
- Binary Models for Marginal Independence
- Fast estimation algorithm for likelihood-based analysis of repeated categorical responses
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Iterative conditional fitting for discrete chain graph models.
- Joint Regression and Association Modeling of Longitudinal Ordinal Data
- Joint Response Graphs and Separation Induced by Triangular Systems
- Likelihood ratio tests and singularities
- Marginal models for categorical data
- Markov Properties for Acyclic Directed Mixed Graphs
- On the Validity of the Markov Interpretation of Path Diagrams of Gaussian Structural Equations Systems with Correlated Errors
- Parameterizations and Fitting of Bi‐directed Graph Models to Categorical Data
- Regression models for discrete longitudinal responses. With comments and a rejoinder by the authors
- SINGULAR
- Stratified exponential families: Graphical models and model selection
- The analysis of multidimensional contingency tables when some variables are posterior to others: a modified path analysis approach
Cited in
(37)- Chain graph models of multivariate regression type for categorical data
- Multiple hidden Markov models for categorical time series
- Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
- A review of Gaussian Markov models for conditional independence
- Discrete models of force chain networks
- Context-specific independencies embedded in chain graph models of type I
- Improving the power of hypothesis tests in sparse contingency tables
- On the causal interpretation of acyclic mixed graphs under multivariate normality
- Context-specific independencies in stratified chain regression graphical models
- Unifying Markov properties for graphical models
- A class of smooth models satisfying marginal and context specific conditional independencies
- Sequences of regressions and their independences
- On a hypergraph probabilistic graphical model
- Order-independent structure learning of multivariate regression chain graphs
- Joint Gaussian graphical model estimation: a survey
- AMP chain graphs: minimal separators and structure learning algorithms
- On expressiveness of the chain graph interpretations
- Marginal parameterizations of discrete models defined by a set of conditional independencies
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- Triangular systems for symmetric binary variables
- Bayesian learning of multiple directed networks from observational data
- Marginalization and conditioning for LWF chain graphs
- Every LWF and AMP chain graph originates from a set of causal models
- Type II chain graph models for categorical data: a smooth subclass
- Graphical models for multivariate Markov chains
- Markovian acyclic directed mixed graphs for discrete data
- Model selection and local geometry
- Chain graph interpretations and their relations revisited
- Probability distributions with summary graph structure
- Smooth, identifiable supermodels of discrete DAG models with latent variables
- Markov properties for mixed graphs
- Marginal AMP chain graphs
- Comments on: Sequences of regressions and their independences
- Properties of graphical regression models for multidimensional categorical data
- Log-mean linear parameterization for discrete graphical models of marginal independence and the analysis of dichotomizations
- Iterative conditional fitting for discrete chain graph models.
- Smoothness of marginal log-linear parameterizations
This page was built for publication: Discrete chain graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q605020)
