A correlation inequality for bipartite graphs (Q2366960)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 232461
Language Label Description Also known as
default for all languages
No label defined
    English
    A correlation inequality for bipartite graphs
    scientific article; zbMATH DE number 232461

      Statements

      A correlation inequality for bipartite graphs (English)
      0 references
      11 August 1993
      0 references
      Let \((V,E)\) be a bipartite graph with vertex partites \(U,W\). When we write \((i,j) \in E\) we imply that \(i \in U\) and \(j \in W\). This paper is devoted to a discussion of the following conjecture and its generalizations. Conjecture 1. For any bipartite graph \((V,E)\) and any bounded, nonnegative, measurable function \(h\) on \([0,1]^ 2\), \[ \int \prod_{(i,j) \in E}h(x_ i,y_ i)d \mu^{| V |} \geq \bigl( \int hd\mu^ 2\bigr)^{| E |} \] where \(\mu\) denotes the Lebesgue measure on [0,1].
      0 references
      bipartite graph
      0 references
      conjecture
      0 references
      Lebesgue measure
      0 references

      Identifiers