Normal binary hierarchical models
DOI10.1080/10586458.2016.1142911zbMATH Open1391.13057DBLPjournals/em/BernsteinS17arXiv1508.05461OpenAlexW2276786749WikidataQ57428751 ScholiaQ57428751MaRDI QIDQ5281709FDOQ5281709
Authors: Daniel Irving Bernstein, Seth Sullivant
Publication date: 26 July 2017
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05461
Recommendations
Contingency tables (62H17) Statistical tables (62Q05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) 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)
Cites Work
- Title not available (Why is that?)
- Higher Lawrence configurations.
- A finiteness theorem for Markov bases of hierarchical models
- Non-very ample configurations arising from contingency tables
- Challenging computations of Hilbert bases of cones associated with algebraic statistics
- Compressed polytopes and statistical disclosure limitation
- Normal binary graph models
Cited In (7)
- Challenging computations of Hilbert bases of cones associated with algebraic statistics
- Neighborliness of marginal polytopes
- Supernormal vector configurations
- Normal approximation for hierarchical structures
- Generalized cut polytopes for binary hierarchical models
- Hierarchical Models, Marginal Polytopes, and Linear Codes
- Unimodular binary hierarchical models
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)