论文标题
随机向量的高斯近似值
Gaussian approximations for random vectors
论文作者
论文摘要
我们对随机向量序列的波动(在欧几里得空间中的值$ \ mathbb {r}^d $)介绍了几种改进,它们在标准化后会收敛到多维高斯分布。更准确地说,我们会以两个方向来完善此类结果:首先,我们可以在其中获得与多维高斯分布的收敛速度的界限,然后我们提供了一个环境,在该设置中,人们可以在哪个环境中获得中等或大的偏差(尤其是在何种规模上,尾巴均匀地保持着尾巴的范围,以及距离盖ussian的尾巴均为对称性的尾巴是断裂的。这些结果扩展了我们针对实际有价值的随机变量获得的一些早期作品,但它们并不是简单的扩展,因为观察到某些新现象在一个维度中看不到。即使对于非常简单的对象,例如在$ \ mathbb {z}^d $中进行的对称随机步行,我们也会观察到对对称性的损失,我们可以量化以远离原点的步行。同样,与kolmogorov距离是自然的一维情况不同,在多维情况下,不再有这样的规范距离。我们选择与所谓的凸距离一起工作,因此,我们认为的可测量集合的几何形状将发挥重要作用(也使证据更加复杂)。我们用一些示例来说明结果,例如相关的随机步行,随机矩阵的特征多项式或随机图中的模式计数。
We present several refinements on the fluctuations of sequences of random vectors (with values in the Euclidean space $\mathbb{R}^d$) which converge after normalization to a multidimensional Gaussian distribution. More precisely we refine such results in two directions: first we give conditions under which one can obtain bounds on the speed of convergence to the multidimensional Gaussian distribution, and then we provide a setting in which one can obtain precise moderate or large deviations (in particular we see at which scale the Gaussian approximation for the tails ceases to hold and how the symmetry of the Gaussian tails is then broken). These results extend some of our earlier works obtained for real valued random variables, but they are not simple extensions, as some new phenomena are observed that could not be visible in one dimension. Even for very simple objects such as the symmetric random walk in $\mathbb{Z}^d$, we observe a loss of symmetry that we can quantify for walks conditioned to be far away from the origin. Also, unlike the one dimensional case where the Kolmogorov distance is natural, in the multidimensional case there is no more such a canonical distance. We choose to work with the so-called convex distance, and as a consequence, the geometry of the Borel measurable sets that we consider shall play an important role (also making the proofs more complicated). We illustrate our results with some examples such as correlated random walks, the characteristic polynomials of random unitary matrices, or pattern countings in random graphs.