In mathematics, the Fortuin–Kasteleyn–Ginibre (FKG) inequality is a correlation inequality, a fundamental tool in statistical mechanics and probabilistic combinatorics (especially random graphs and the probabilistic method), due to . Informally, it says that in many random systems, increasing events are positively correlated, while an increasing and a decreasing event are negatively correlated. It was obtained by studying the random cluster model. An earlier version, for the special case of i.i.d. variables, called Harris inequality, is due to , see below. One generalization of the FKG inequality is the Holley inequality (1974) below, and an even further generalization is the Ahlswede–Daykin "four functions" theorem (1978). Furthermore, it has the same conclusion as the Griffiths inequalities, but the hypotheses are different. Let be a finite distributive lattice, and μ a nonnegative function on it, that is assumed to satisfy the (FKG) lattice condition (sometimes a function satisfying this condition is called log supermodular) i.e., for all x, y in the lattice . The FKG inequality then says that for any two monotonically increasing functions ƒ and g on , the following positive correlation inequality holds: The same inequality (positive correlation) is true when both ƒ and g are decreasing. If one is increasing and the other is decreasing, then they are negatively correlated and the above inequality is reversed. Similar statements hold more generally, when is not necessarily finite, not even countable. In that case, μ has to be a finite measure, and the lattice condition has to be defined using cylinder events; see, e.g., Section 2.2 of . For proofs, see or the Ahlswede–Daykin inequality (1978). Also, a rough sketch is given below, due to , using a Markov chain coupling argument. The lattice condition for μ is also called multivariate total positivity, and sometimes the strong FKG condition; the term (multiplicative) FKG condition is also used in older literature.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.