Normal binary hierarchical models
From MaRDI portal
Combinatorial aspects of simplicial complexes (05E45) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Computational aspects in algebraic geometry (14Q99) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Contingency tables (62H17) Statistical tables (62Q05)
Abstract: Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of operations on simplicial complexes that preserve normality, constructions of families of minimally nonnormal complexes, and computations classifying all of the normal complexes on up to six vertices. We repeat this analysis for compressed vector configurations, classifying all of the compressed complexes on up to six vertices.
Recommendations
Cites work
- A finiteness theorem for Markov bases of hierarchical models
- Challenging computations of Hilbert bases of cones associated with algebraic statistics
- Compressed polytopes and statistical disclosure limitation
- Higher Lawrence configurations.
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Normal binary graph models
Cited in
(9)- Normal approximation for hierarchical structures
- Normal binary graph models
- Unimodular hierarchical models and their Graver bases
- Hierarchical Models, Marginal Polytopes, and Linear Codes
- Challenging computations of Hilbert bases of cones associated with algebraic statistics
- Unimodular binary hierarchical models
- Supernormal vector configurations
- Generalized cut polytopes for binary hierarchical models
- Neighborliness of marginal polytopes
This page was built for publication: Normal binary hierarchical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281709)
