arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.02540math.PR
收藏

相依分布下布尔立方体的集中性分类

Classifying the Concentration of the Boolean Cube for Dependent Distributions

Jonathan Root, Mark Kon

AI总结:

本文研究相依分布下布尔立方体上 Hamming 距离的集中性,证明集中速率依赖于固定点选择及条件分布方差,并给出适用于所有分布的归纳界及相关条件刻画。

摘要:

一个度量概率空间 $(Ω,d)$ 若满足以下性质,则称其服从度量集中现象:当转移参数 $ε$ 趋近某个极限时,测度为 $1/2$ 的子集会扩张为测度接近 1 的子集。本文考虑空间自身的集中性,即对固定的 $y\in Ω$,度量 $d(x,y)$ 的集中性。对任意 $y\in Ω$,在高维 $n$ 下,乘积分布能保证 $d(x,y)$ 的集中性,因为 $d(x,y)$ 是关于 $x$ 的 Lipschitz 函数。事实上,在乘积情形下,对任意固定的 $y\in Ω$,度量集中的速率在 $n$ 上具有相同的阶。然而,对于某些相依(非乘积)分布,这一结论并不成立。对于布尔立方体 $I_n$(一个被广泛分析的简单模型),我们证明:对任意相依分布,固定 $y$ 时 Hamming 距离 $d_H(x,y)$ 的集中速率取决于 $y\in I_n$ 的选择,以及条件分布 $μ(x_k \mid x_1,\dots, x_{k-1})$($2\leq k\leq n$)的方差。我们给出一个对所有布尔立方体上的概率分布都成立的归纳界,并通过某种正(负)相关条件刻画集中性的质量。我们的证明方法既简单又全面,具有优势。当条件分布的方差可忽略时,我们考虑一致有界技术,并展示这一基本技术如何应用于布尔立方体上整类 Lipschitz 函数的集中性。

英文摘要:

A metric probability space $(Ω,d)$ obeys the ${\it concentration\; of\; measure\; phenomenon}$ if subsets of measure $1/2$ enlarge to subsets of measure close to 1 as a transition parameter $ε$ approaches a limit. In this paper we consider the concentration of the space itself, namely the concentration of the metric $d(x,y)$ for a fixed $y\in Ω$. For any $y\in Ω$, the concentration of $d(x,y)$ is guaranteed for product distributions in high dimensions $n$, as $d(x,y)$ is a Lipschitz function in $x$. In fact, in the product setting, the rate at which the metric concentrates is of the same order in $n$ for any fixed $y\in Ω$. The same thing, however, cannot be said for certain dependent (non-product) distributions. For the Boolean cube $I_n$ (a widely analyzed simple model), we show that, for any dependent distribution, the rate of concentration of the Hamming distance $d_H(x,y)$, for a fixed $y$, depends on the choice of $y\in I_n$, and on the variance of the conditional distributions $μ(x_k \mid x_1,\dots, x_{k-1})$, $2\leq k\leq n$. We give an inductive bound which holds for all probability distributions on the Boolean cube, and characterize the quality of concentration by a certain positive (negative) correlation condition. Our method of proof is advantageous in that it is both simple and comprehensive. We consider uniform bounding techniques when the variance of the conditional distributions is negligible, and show how this basic technique applies to the concentration of the entire class of Lipschitz functions on the Boolean cube.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑