KMT定理的一个概念和两种证明
One idea and two proofs of the KMT theorems
摘要:
给出了一致经验过程和简单对称随机游动的Komlós-Major-Tusnády嵌入定理的两个证明.更确切地说,所证明的是证明中所需要的单变量耦合结果,例如Tusnády引理。这些证明是对现有证明架构的修改,一个组合(原始证明有许多修改,由于Csörgoun,Révész,Bretagnolle,Massart,Dudley,Carter,Pollard等)。和一个分析(由于Sourav Chatterjee)。这两种证明都有一个共同的想法:我们比较二项分布和超几何分布,而不是与高斯分布进行比较。在组合方法中,这涉及比较二项(n,1/2)分布与二项(4 n,1/2)分布,这主要涉及比较对应的二项式系数。在分析方法中,这将Chatterjee的方法简化为将整数上的最近邻马尔可夫链耦合,以便它们保持接近。
英文摘要:
Two proofs of the Komlós-Major-Tusnády embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the proofs, such as Tusnády's lemma. These proofs are modifications of existing proof architectures, one combinatorial (the original proof with many modifications, due to Csörgõ, Révész, Bretagnolle, Massart, Dudley, Carter, Pollard etc.) and one analytical (due to Sourav Chatterjee). There is one common idea to both proofs: we compare binomial and hypergeometric distributions among themselves, rather than with the Gaussian distribution. In the combinatorial approach, this involves comparing Binomial(n,1/2) distribution with the Binomial(4n,1/2) distribution, which mainly involves comparison between the corresponding binomial coefficients. In the analytical approach, this reduces Chatterjee's method to coupling nearest neighbour Markov chains on integers so that they stay close.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。