相关论文: The Codegree, Weak Maximum Likelihood Threshold, a…
The codegree ${\rm codeg}(\mathcal{P})$ of a lattice polytope $\mathcal{P}$ is a fundamental invariant in discrete geometry. In the present paper, we investigate the codegree of the stable set polytope $\mathcal{P}_G$ associated with a…
The maximum likelihood threshold of a graph is the smallest number of data points that guarantees that maximum likelihood estimates exist almost surely in the Gaussian graphical model associated to the graph. We show that this graph…
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 the observed margins lie in the relative interior of the…
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…
The maximum likelihood threshold (MLT) of a graph $G$ is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding Gaussian graphical model. We give a new characterization of…
A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…
Given a statistical model, the maximum likelihood degree is the number of complex solutions to the likelihood equations for generic data. We consider discrete algebraic statistical models and study the solutions to the likelihood equations…
We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of the likelihood function restricted to the…
We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…
Given a family of lattice polytopes, a common endeavor in Ehrhart theory is the classification of those polytopes in the family that are Gorenstein, or more generally level. In this article, we consider these questions for…
The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $\omega(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be…
We study a number of conditions on the Hilbert function of a level artinian algebra which imply the Weak Lefschetz Property (WLP). Possibly the most important open case is whether a codimension 3 SI-sequence forces the WLP for level…
We study the problem of maximizing information divergence from a new perspective using logarithmic Voronoi polytopes. We show that for linear models, the maximum is always achieved at the boundary of the probability simplex. For toric…
One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…
Let $X$ be a Gorenstein minimal projective 3-fold with at worst locally factorial terminal singularities. Suppose the canonical map is of fiber type. Denote by $F$ a smooth model of a generic irreducible component in fibers of the canonical…
The study of the closest point(s) on a statistical model from a given distribution in the probability simplex with respect to a fixed Wasserstein metric gives rise to a polyhedral norm distance optimization problem. There are two components…
Random probabilities are a key component to many nonparametric methods in Statistics and Machine Learning. To quantify comparisons between different laws of random probabilities several works are starting to use the elegant Wasserstein over…
Let $R=\mathbb K[x,y,z]$ be a standard graded polynomial ring where $\mathbb K$ is an algebraically closed field of characteristic zero. Let $M = \oplus_j M_j$ be a finite length graded $R$-module. We say that $M$ has the Weak Lefschetz…
The maximum likelihood threshold (MLT) of a graph $G$ is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding Gaussian graphical model. Recently a new characterization of…
We consider the conjecture that all artinian height 4 complete intersections of forms of the same degree $d$ have the Weak Lefschetz Property (WLP). We translate this problem to one of studying the general hyperplane section of a certain…