Hierarchical Models, Marginal Polytopes, and Linear Codes
Statistics Theory
2016-04-08 v2 Statistics Theory
Abstract
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is determined. We classify all full dimensional polytopes with the property that their vertices form a linear code and give an algorithm that determines them.
Keywords
Cite
@article{arxiv.0805.1301,
title = {Hierarchical Models, Marginal Polytopes, and Linear Codes},
author = {Thomas Kahle and Walter Wenzel and Nihat Ay},
journal= {arXiv preprint arXiv:0805.1301},
year = {2016}
}
Comments
18 pages