Loading AI tools
From Wikipedia, the free encyclopedia
In probability theory, the Chung–Erdős inequality provides a lower bound on the probability that one out of many (possibly dependent) events occurs. The lower bound is expressed in terms of the probabilities for pairs of events.
Formally, let be events. Assume that for some . Then
The inequality was first derived by Kai Lai Chung and Paul Erdős (in,[1] equation (4)). It was stated in the form given above by Petrov (in,[2] equation (6.10)). It can be obtained by applying the Paley–Zygmund inequality to the number of which occur.
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.