Related papers: Neighborliness of Marginal Polytopes
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…
Associated to each simplicial complex is a binary hierarchical model. We classify the simplicial complexes that yield unimodular binary hierarchical models. Our main theorem provides both a construction of all unimodular binary hierarchical…
We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, are conjectured for these…
The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of…
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…
We study the set of no-signalling empirical models on a measurement scenario, and show that the combinatorial structure of the no-signalling polytope is completely determined by the possibilistic information given by the support of the…
Marginal models involve restrictions on the conditional and marginal association structure of a set of categorical variables. They generalize log-linear models for contingency tables, which are the fundamental tools for modelling the…
The present paper has two goals. First to present a natural example of a new class of random fields which are the variable neighborhood random fields. The example we consider is a partially observed nearest neighbor binary Markov random…
We impose rank one constraints on marginalizations of a tensor, given by a simplicial complex. Following work of Kirkup and Sullivant, such marginal independence models can be made toric by a linear change of coordinates. We study their…
We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…
The mix of two maniplexes is the minimal maniplex that covers both. This construction has many important applications, such as finding the smallest regular cover of a maniplex. If one of the maniplexes is an abstract polytope, a natural…
This article extends the literature on copulas with discrete or continuous marginals to the case where some of the marginals are a mixture of discrete and continuous components. We do so by carefully defining the likelihood as the density…
Conditions are presented for different types of identifiability of discrete variable models generated over an undirected graph in which one node represents a binary hidden variable. These models can be seen as extensions of the latent class…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
We introduce the multineighbor complex of a graph, which is a simplicial complex in which a simplex is a subset of the graph with a sufficient number of mutual neighbors. We investigate the asymptotic homological properties of such…
The Newton polytope related to a ``minimal" counterexample to the Jacobian conjecture is introduced and described. This description allows to obtain a sharper estimate for the geometric degree of the polynomial mapping given by a Jacobian…
Higher order Bernstein- and Markov-type inequalities are established for trigonometric polynomials on compact subsets of the real line and algebraic polynomials on compact subsets of the unit circle. In the case of Markov-type inequalities…
A characterization of simplicial objects in categories with finite products obtained by the reduced bar construction is given. The condition that characterizes such simplicial objects is a strictification of Segal's condition guaranteeing…
In the propositional setting, the marginal problem is to find a (maximum-entropy) distribution that has some given marginals. We study this problem in a relational setting and make the following contributions. First, we compare two…
Discrete Markov random fields form a natural class of models to represent images and spatial data sets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and…