English

Bernoulli Correlations and Cut Polytopes

Probability 2017-07-04 v2 Combinatorics Metric Geometry Optimization and Control Statistics Theory Statistics Theory

Abstract

Given nn symmetric Bernoulli variables, what can be said about their correlation matrix viewed as a vector? We show that the set of those vectors R(Bn)R(\mathcal{B}_n) is a polytope and identify its vertices. Those extreme points correspond to correlation vectors associated to the discrete uniform distributions on diagonals of the cube [0,1]n[0,1]^n. We also show that the polytope is affinely isomorphic to a well-known cut polytope CUT(n){\rm CUT}(n) which is defined as a convex hull of the cut vectors in a complete graph with vertex set {1,,n}\{1,\ldots,n\}. The isomorphism is obtained explicitly as R(Bn)=12 CUT(n)R(\mathcal{B}_n)= {\mathbf{1}}-2~{\rm CUT}(n). As a corollary of this work, it is straightforward using linear programming to determine if a particular correlation matrix is realizable or not. Furthermore, a sampling method for multivariate symmetric Bernoullis with given correlation is obtained. In some cases the method can also be used for general, not exclusively Bernoulli, marginals.

Keywords

Cite

@article{arxiv.1706.06182,
  title  = {Bernoulli Correlations and Cut Polytopes},
  author = {Mark Huber and Nevena Maric},
  journal= {arXiv preprint arXiv:1706.06182},
  year   = {2017}
}

Comments

15 pages; minor changes compared to the previous version, mostly stylistic

R2 v1 2026-06-22T20:23:19.309Z