Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A BK inequality for randomly drawn subsets of fixed size (1105.3862v2)

Published 19 May 2011 in math.PR

Abstract: The BK inequality (\cite{BK85}) says that,for product measures on ${0,1}n$, the probability that two increasing events $A$ and $B$ `occur disjointly' is at most the product of the two individual probabilities. The conjecture in \cite{BK85} that this holds for {\em all} events was proved by Reimer (cite{R00}). Several other problems in this area remained open. For instance, although it is easy to see that non-product measures cannot satisfy the above inequality for {\em all} events,there are several such measures which, intuitively, should satisfy the inequality for all{\em increasing} events. One of the most natural candidates is the measure assigning equal probabilities to all configurations with exactly $k$ 1's (and probability 0 to all other configurations). The main contribution of this paper is a proof for these measures. We also point out how our result extends to weighted versions of these measures, and to products of such measures.

Summary

We haven't generated a summary for this paper yet.