相关论文: A Natural Extension of the BK Inequality

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…

Recently, van den Berg and Jonasson gave the first substantial extension of the BK inequality for non-product measures: they proved that, for k-out-of-n measures, the probability that two increasing events occur disjointly is at most the…

Let $G=(S,T,E)$ be a bipartite graph. For a matching $M$ of $G$, let $V(M)$ be the set of vertices covered by $M$, and let $B(M)$ be the symmetric difference of $V(M)$ and $S$. We prove that if $M$ is a uniform random matching of $G$, then…

The BKR inequality conjectured by van den Berg and Kesten in [11], and proved by Reimer in [8], states that for $A$ and $B$ events on $S$, a finite product of finite sets $S_i,i=1,\ldots,n$, and $P$ any product measure on $S$, $$ P(A \Box…

We remove the hypothesis "$S$ is finite" from the BKR inequality for product measures on $S^d$, which raises some issues related to descriptive set theory. We also discuss the extension of the BKR operator and inequality, from 2 events to 2…

Separated-occurrence inequalities are variants for dependent lattice models of the van den Berg-Kesten inequality for independent models. They take the form $P(A \circ_r B) \leq (1 + ce^{-\epsilon r})P(A)P(B)$, where $A \circ_r B$ is the…

We describe a method of extending Bell inequalities from $n$ to $n+1$ parties and formulate sufficient conditions for our method to produce tight inequalities from tight inequalities. The method is non trivial in the sense that the…

In classical percolation theory, the van den Berg-Kesten (BK) inequality is a fundamental tool that shows that disjoint events induce negative conditionings on each other. The inequality also holds in the context of last passage percolation…

We give an extension of the FKG inequality to the case of multiple events with equal pairwise intersections. We then apply this inequality to resolve Kahn's question on positive associated (PA) measures.

Nonlocal tests on multi-partite quantum correlations form the basis of protocols that certify randomness in a device-independent (DI) way. Such correlations admit a rich structure, making the task of choosing an appropriate test difficult.…

We extend Fano's inequality, which controls the average probability of events in terms of the average of some $f$--divergences, to work with arbitrary events (not necessarily forming a partition) and even with arbitrary $[0,1]$--valued…

We prove that for a discrete determinantal process the BK inequality occurs for increasing events generated by simple points. We give also some elementary, but nonetheless appealing relationship, between a discrete determinantal process and…

In this paper, we propose a new approach for deriving probabilistic inequalities. Our main idea is to exploit the information of underlying distributions by virtue of the monotone likelihood ratio property and Berry-Essen inequality.…

Janson and Janson, Luczak and Rucinski proved several inequalities for the lower tail of the distribution of the number of events that hold, when all the events are up-sets (increasing events) of a special form - each event is the…

Known Bernstein-type upper bounds on the tail probabilities for sums of independent zero-mean sub-exponential random variables are improved in several ways at once. The new upper bounds have a certain optimality property.

We consider a type of random processes which satisfies the conditional increment condition and obtain an estimate for the tail probability and a Doob-type inequality of the maximum of the process. The main result is that, for processes…

We present some extensions of Bernstein's concentration inequality for random matrices. This inequality has become a useful and powerful tool for many problems in statistics, signal processing and theoretical computer science. The main…

The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the…

Yager[5] proposed a transformation for opposing(negating) the occurence of an event that is not certain using the idea that one can oppose the occurence of any uncertain event by allocating its probability among the other outcomes in the…

This article is a survey of results concerning an inequality, which may be seen as a versatile tool to solve problems in the domain of Applied Probability. The inequality, which we call BRS-inequality, gives a convenient upper bound for the…