89 citations · 103 across the 13 of their papers we have counts for
5 papers · 1 filter
Normal binary graph models
Seth Sullivant
We show that the marginal semigroup of a binary graph model is normal if and only if the graph is free of K_4 minors. The technique, based on the interplay of normality and the geo…
Compressed polytopes and statistical disclosure limitation
Seth Sullivant
We provide a characterization of the compressed lattice polytopes in terms of their facet defining inequalities and we show that every compressed lattice polytope is affinely isomo…
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
Nicholas Eriksson, Stephen E. Fienberg, Alessandro Rinaldo +1
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if…
A finiteness theorem for Markov bases of hierarchical models
Serkan Hosten, Seth Sullivant
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimens…
Markov bases of binary graph models
Mike Develin, Seth Sullivant
This paper is concerned with the topological invariant of a graph given by the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tab…