Skip to main content
Article thumbnail
Location of Repository

A combinatorial approach to correlation inequalities

By Graham Brightwell and William T. Trotter


In this paper, we initiate a combinatorial approach to proving correlation inequalities for finite partially ordered sets. A new proof is provided for the strong form of the XYZ theorem, due to Fishburn. We also use our method to give a new proof of a related correlation result of Shepp involving two sets of relations. Our arguments are entirely combinatorial in the sense that they do not make use of the Ahlswede/Daykin theorem or any of its relatives

Topics: QA Mathematics
Publisher: Elsevier
Year: 2002
DOI identifier: 10.1016/S0012-365X(02)00432-6
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.