A short proof and a generalization of the BKR-inequality
英文摘要:
There is a serious mistake in the proof.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Martin Hutzenthaler
There is a serious mistake in the proof.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
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 or more events, and we remove, in one sense, the hypothesis that $d$ be finite.
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 B) \le P(A)P(B),$$ where the set $A \Box B$ consists of the elementary events which lie in both $A$ and $B$ for `disjoint reasons.' Precisely, with ${\bf n}:=\{1,\ldots,n\}$ and $K \subset {\bf n}$, for ${\bf x} \in S$ letting $[{\bf x}]_K=\{{\bf y} \in S: y_i = x_i, i \in K\}$, the set $A \Box B$ consists of all ${\bf x} \in S$ for which there exist disjoint…
In this article, we derive a new generalization of Chebyshev inequality for random vectors. We demonstrate that the new generalization is much less conservative than the classical generalization.
We prove a non-asymptotic generalization of the refined continuity correction developed in Cressie (1978) for the Binomial distribution, which we then use to improve the versions of Tusnády's inequality from Massart (2002) and Carter & Pollard (2004) in the bulk.
A short proof of the classic Hardy inequality is presented for $p$-norms with $p>1$. Along the lines of this proof a sharpened version is proved of a recent generalization of Hardy's inequality in the terminology of probability theory. A probability theoretic version of Copson's inequality is discussed as well. Also for $0<p<1$ probability theoretic generalizations of the Hardy and the Copson inequality are proved.
We prove a multivariate version of Hoeffding's inequality about the distribution of homogeneous polynomials of Rademacher functions. The proof is based on such an estimate about the moments of homogeneous polynomials of Rademacher functions which can be considered as an improvement of Borell's inequality in a most important special case.
A generalization of Grünbaum's inequality in RCD$(0,N)$-spaces
将Grünbaum不等式推广至非负Ricci曲率空间(RCD(0,N)空间及加权黎曼流形),利用等距分裂定理和Busemann函数给出体积下界,并推广至非均匀分布,建立刚性结果并研究稳定性。
We derive the exponential as well as power decreasing tail estimations for normed sums of centered independent identical distributed (or not) random variables on the Khintchine's form. We consider arbitrary, in particular, non-Rademacher's variables and not only Lebesgue-Riesz rearrangement invariant norms for the random variables. We intend to calculate the value of correspondent limit.
We interpret the Leggett-Garg (LG) inequality as a kind of contextual probabilistic inequality in which one combines data collected in experiments performed for three different contexts. In the original version of the inequality these contexts have the temporal nature and they are given by three pairs of instances of time, $(t_1, t_2), (t_2, t_3), (t_3, t_4),$ where $t_1 < t_2 < t_3.$ We generalize LG conditions of macroscopic realism and noninvasive measurability in the general contextual framework. Our formulation is done in the purely probabilistic terms: existence of the context independen…
Sharp unifying generalizations of Opial's inequality
本文提出基于分布函数的 Opial 不等式尖锐统一推广,涵盖连续与离散形式及任意阶导数,改进了已有常数,并讨论加权形式与相关 Wirtinger 不等式。
In queueing theory, Lorden's inequality can be used for bounds estimation of the moments of backward and forward renewal times. Two random variables called backwards renewal time and forward renewal time for this process are defined. Lorden's inequality it's true for the renewal process, so expectations of backward and forward renewal times are bounded by the relation of expectation of moment of the random variable for any fixed moment of time, where random variables are i.i.d. We generalised and proved a similar result for dependent random variables with finite expectations, some constant C a…
In this paper, we obtain a new generalization of Chebyshev's inequality for random elements taking values in a separate Banach space.
For any $N\ge 2$ and $å:=(å_1,\cdots, å_{N+1})\in (0,\infty)^{N+1}$, let $μ^{(N)}_å$ be the corresponding Dirichlet distribution on $\DD:= \big\{ x=(x_i)_{1\le i\le N}\in [0,1]^N:\ \sum_{1\le i\le N} x_i\le 1\big\}.$ We prove the Poincaré inequality $$μ^{(N)}_å(f^2)\le \ff 1 {å_{N+1}} \int_{\DD}\Big\{\Big(1-\sum_{1\le i\le N} x_i\Big) \sum_{n=1}^N x_n(\pp_n f)^2\Big\}μ^{(N)}_å(\d x)+μ^{(N)}_å(f)^2,\ f\in C^1(\DD)$$ and show that the constant $\ff 1 {å_{N+1}}$ is sharp. Consequently, the associated diffusion process on $\DD$ converges to $μ^{(N)}_å$ in $L^2(μ^{(N)}_å)$ at the exponentially rate…
In this note we are concerned about the generalization of the GHS inequality for the Potts model. We also obtain by a different method the proof of the GHS inequality for the Ising model. We take advantage of a polynomial expansion and we derive that some of the variables of the polynomial can be separated
In this paper, we provide a new framework to obtain the generalization bounds of the learning process for domain adaptation, and then apply the derived bounds to analyze the asymptotical convergence of the learning process. Without loss of generality, we consider two kinds of representative domain adaptation: one is with multiple sources and the other is combining source and target data. In particular, we use the integral probability metric to measure the difference between two domains. For either kind of domain adaptation, we develop a related Hoeffding-type deviation inequality and a symmetr…
Multivariate correlation inequalities for $P$-partitions
本文将 Fishburn、Daykin–Daykin–Paterson 及 Brightwell–Felsner–Trotter 等偏序集相关不等式推广到多元 $P$-分拆情形,证明依赖 Ahlswede–Daykin 不等式的多元推广。
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter ranges. The conjecture would provide a unified proof of recent entropy power inequalities of Barron and Madiman, as well as of a (conjectured) generalization of the Brunn-Minkowski inequality. It is shown that the generalized Brunn-Minkowski conjecture is true for convex sets; an application of this to the law of large numbers for random sets is described.
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。