Related papers: Lattice supported distributions and graphical mode…
Ranking systems produce ordered lists from scalar scores, yet the ranking itself depends only on pairwise comparisons. We develop a mathematical theory that takes this observation seriously, centering the analysis on pairwise margins rather…
We prove that every finitely generated convex set of finitely supported probability distributions has a unique base, and use this result to show that the monad of convex sets of probability distributions is presented by the algebraic theory…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
We consider the problem of estimating the parameters in a pairwise graphical model in which the distribution of each node, conditioned on the others, may have a different parametric form. In particular, we assume that each node's…
This paper explores mixture distributions induced by a product of the positive stable random variable and a power of another positive random variable. The paper also considers the convolution of the stable density with a gamma density.…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
We suggest a new Hamiltonian lattice approach, using a regularisation motivated by deep inelastic scattering. We discuss the relation between distribution functions and the $F_1$ structure function. We have tested this method by computing…
We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using the Bhatia-Davis inequality linking the variance, the…
We study recursively defined functions associated with directed graphs on the k dimensional nonnegative integral lattice. The existence of certain combinatorial structures associated with these function classes are shown to be independent…
We define two algorithms for propagating information in classification problems with pairwise relationships. The algorithms are based on contraction maps and are related to non-linear diffusion and random walks on graphs. The approach is…
In this paper, we consider the multivariate Bernoulli distribution as a model to estimate the structure of graphs with binary nodes. This distribution is discussed in the framework of the exponential family, and its statistical properties…
We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…
We study random walks on contingency tables with fixed marginals, corresponding to a (log-linear) hierarchical model. If the set of allowed moves is not a Markov basis, then there exist tables with the same marginals that are not connected.…
We consider supercritical branching random walks on transitive graphs and we prove a law of large numbers for the mean displacement of the ensemble of particles, and a Stam-type central limit theorem for the empirical distributions, thus…
We consider the problem of determining the limiting spectral distribution for random matrices whose row distributions are permitted to have limited dependence. We assume mild moment conditions and give an extension of the…
Neighborhood regression has been a successful approach in graphical and structural equation modeling, with applications to learning undirected and directed graphical models. We extend these ideas by defining and studying an algebraic…
This work proves that ranks and shares are statistically dependent on one another, based on simple combinatorics. It presents a formula for rank-share distribution and illustrates that Zipfs law, is descended from expected values of various…
We present new scalar and matrix Chernoff-style concentration bounds for a broad class of probability distributions over the binary hypercube $\{0,1\}^n$. Motivated by recent tools developed for the study of mixing times of Markov chains on…
We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…