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

稳定泛函的正规逼近

Normal approximation for stabilizing functionals

Raphaël Lachièze-Rey, Matthias Schulte, J. E. Yukich

摘要:

我们建立了一般度量空间上一类大的标记Poisson和二项式点过程的几何泛函关于Kolmogorov距离的可能的最优正规收敛速度。只要几何泛函可表示为满足矩条件的指数稳定得分函数之和,则比率是有效的。通过将稳定的方法到Malliavin-Stein理论中,我们得到的稳定得分函数的总和的正常逼近率,无论是改善现有的速度或第一类。我们的一般率持有的空间上的标记输入比全维子集的$\mathbb{R}^d$,包括$m$维黎曼流形,$m\leq d$更一般的泛函。我们使用的一般结果推导出改进的和新的速度正常收敛的随机几何中的几个泛函,包括那些方差重新缩放的体积或表面积的基础集。特别地,我们改进了在$d\geq 2$维光滑凸体中Poisson和二项式随机样本凸包的$k$ -面和$i$ th内禀体积泛函的正常收敛速度.我们还提供了改进的最近邻图和高维数据集的统计,在一个随机样本的最大点的数量,估计表面积和体积通过Voronoi镶嵌集近似产生的正常收敛率,和团计数在广义随机几何图形。

英文摘要:

We establish presumably optimal rates of normal convergence with respect to the Kolmogorov distance for a large class of geometric functionals of marked Poisson and binomial point processes on general metric spaces. The rates are valid whenever the geometric functional is expressible as a sum of exponentially stabilizing score functions satisfying a moment condition. By incorporating stabilization methods into the Malliavin-Stein theory, we obtain rates of normal approximation for sums of stabilizing score functions which either improve upon existing rates or are the first of their kind. Our general rates hold for functionals of marked input on spaces more general than full-dimensional subsets of $\mathbb{R}^d$, including $m$-dimensional Riemannian manifolds, $m\leq d$. We use the general results to deduce improved and new rates of normal convergence for several functionals in stochastic geometry, including those whose variances re-scale as the volume or the surface area of an underlying set. In particular, we improve upon rates of normal convergence for the $k$-face and $i$th intrinsic volume functionals of the convex hull of Poisson and binomial random samples in a smooth convex body in dimension $d\geq 2$. We also provide improved rates of normal convergence for statistics of nearest neighbors graphs and high-dimensional data sets, the number of maximal points in a random sample, estimators of surface area and volume arising in set approximation via Voronoi tessellations, and clique counts in generalized random geometric graphs.

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

↑