REVIEW 2 cited by
Quantitative CLTs on the Poisson space via Skorohod estimates and $p$-Poincar\'e inequalities
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We establish new explicit bounds on the Gaussian approximation of Poisson functionals based on novel estimates of moments of Skorohod integrals. Combining these with the Malliavin-Stein method, we derive bounds in the Wasserstein and Kolmogorov distances whose application requires minimal moment assumptions on add-one cost operators $\unicode{x2014}$ thereby extending the results from (Last, Peccati and Schulte, 2016). Our applications include a CLT for the Online Nearest Neighbour graph, whose validity was conjectured in (Wade, 2009; Penrose and Wade, 2009). We also apply our techniques to derive quantitative CLTs for edge functionals of the Gilbert graph, of the $k$-Nearest Neighbour graph and of the Radial Spanning Tree, both in cases where qualitative CLTs are known and unknown.
Forward citations
Cited by 2 Pith papers
-
Finding the root in random nearest neighbor trees
For random nearest neighbor trees, the root can be found among a confidence set of size roughly log(1/epsilon) divided by log log(1/epsilon) in one dimension.
-
Gaussian and Bootstrap Approximation for Matching-based Average Treatment Effect Estimators
Matching-based ATE estimators have explicit non-asymptotic Gaussian and multiplier-bootstrap approximation bounds with rates in sample size, number of matches, and treatment balance.
Discussion (0). Continue with ORCID to comment.