Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.11560

The Codegree, Weak Maximum Likelihood Threshold, and the Gorenstein Property of Hierarchical Models

Joseph Johnson·Seth Sullivant
View original source ↗Read source document ↗Export metadata ↓

Abstract

The codegree of a lattice polytope is the smallest integer dilate that contains a lattice point in the relative interior. The weak maximum likelihood threshold of a statistical model is the smallest number of data points for which there is a non-zero probability that the maximum likelihood estimate exists. The codegree of a marginal polytope is a lower bound on the maximum likelihood threshold of the associated log-linear model, and they are equal when the marginal polytope is normal. We prove a lower bound on the codegree in the case of hierarchical log-linear models and provide a conjectural formula for the codegree in general. As an application, we study when the marginal polytopes of hierarchical models are Gorenstein, including a classification of Gorenstein decomposable models, and a conjectural classification of Gorenstein binary hierarchical models.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Johnson, Seth Sullivant. 2023-10-17. The Codegree, Weak Maximum Likelihood Threshold, and the Gorenstein Property of Hierarchical Models. https://doi.org/10.2140/astat.2025.16.201

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗