A simplified second-order Gaussian Poincaré inequality in discrete setting with applications
A simplified second-order Gaussian Poincaré inequality in discrete setting with applications
复制标题
离散环境下简化的二阶高斯庞加莱不等式及其应用
DOI:
10.1214/22-aihp1247
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Guangqu Zheng
中科院分区:
文献类型:
--
作者:
P. Eichelsbacher;Benedikt Rednoss;Christoph Thale;Guangqu Zheng
. In this paper, a simplified second-order Gaussian Poincaré inequality for normal approximation of functionals over infinitely many Rademacher random variables is derived. It is based on a new bound for the Kolmogorov distance between a general Rademacher functional and a Gaussian random variable, which is established by means of the discrete Malliavin-Stein method and is of independent interest. As an application, the number of vertices with prescribed degree and the subgraph counting statistic in the Erdős-Rényi random graph are discussed. The number of vertices of fixed degree is also studied for percolation on the Hamming hypercube. Moreover, the number of isolated faces in the Linial-Meshulam-Wallach random κ -complex and infinite weighted 2-runs are treated.