Marginalization and collapsibility in graphical interaction models (Q2277717)

From MaRDI portal





scientific article; zbMATH DE number 4197186
Language Label Description Also known as
default for all languages
No label defined
    English
    Marginalization and collapsibility in graphical interaction models
    scientific article; zbMATH DE number 4197186

      Statements

      Marginalization and collapsibility in graphical interaction models (English)
      0 references
      0 references
      1990
      0 references
      A graphical interaction model is a model for association among variables where each variable is represented by a vertex on the graph, and two vertices are connected if there is a direct association between the corresponding variables, so that two variables are not connected if they are conditionally independent given some other variables. Such a model is called collapsible onto a set of variables if the implied model for the marginal distributions for these variables is equal to the graphical interaction model given by the induced subgraph. A necessary and sufficient condition for collapsibility is found. Several implications of collapsibility are discussed.
      0 references
      association models
      0 references
      decomposition
      0 references
      maximum likelihood estimate
      0 references
      contingency tables
      0 references
      covariance selection
      0 references
      marginalization
      0 references
      cut
      0 references
      graphical interaction model
      0 references
      necessary and sufficient condition for collapsibility
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references