Finding the minimal set for collapsible graphical models
DOI10.1090/S0002-9939-2010-10509-9zbMATH Open1207.62115MaRDI QIDQ3082304FDOQ3082304
Authors: Xiao Fei Wang, Xuming He, Jianhua Guo 
Publication date: 10 March 2011
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Recommendations
Applications of graph theory (05C90) Software, source code, etc. for problems pertaining to statistics (62-04) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Contingency tables (62H17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Sparse graphical models for exploring gene expression data
- Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
- Decomposition by clique separators
- Optimal decomposition by clique separators
- Title not available (Why is that?)
- Title not available (Why is that?)
- Marginalization and collapsibility in graphical interaction models
- Collapsibility and response variables in contingency tables
- Junction trees of general graphs
- Amendments and corrections
Cited In (6)
- Hyper Markov law in undirected graphical models with its applications
- Collapsibility of Graphical CG-Regression Models
- Decomposition of two classes of structural models
- Collapsibility for directed acyclic graphs
- Algorithms for convex hull finding in undirected graphical models
- Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables
Uses Software
This page was built for publication: Finding the minimal set for collapsible graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082304)
