Bounds to the normal for proximity region graphs

DOI10.1016/J.SPA.2017.07.002zbMATH Open1390.60049arXiv1510.09188OpenAlexW1950315276MaRDI QIDQ1743341FDOQ1743341

Authors: Larry Goldstein, Tobias Johnson, Raphael Lachieze-Rey 

Publication date: 13 April 2018

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Abstract: In a proximity region graph $calG$ in $mathbb{R}^d$, two distinct points $x,y$ of a point process $mu$ are connected when the 'forbidden region' $S(x,y)$ these points determine has empty intersection with $mu$. The Gabriel graph, where $S(x,y)$ is the open disc with diameter the line segment connecting $x$ and $y$, is one canonical example. When $mu$ is a Poisson or binomial process, under broad conditions on the regions $S(x,y)$, bounds on the Kolmogorov and Wasserstein distances to the normal are produced for functionals of $calG$, including the total number of edges and the total length. Variance lower bounds, not requiring strong stabilization, are also proven to hold for a class of such functionals.

Full work available at URL: https://arxiv.org/abs/1510.09188

Recommendations

• Limit theory for the Gilbert graph
• Central limit theorems for some graphs in computational geometry.
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
• On the variance of the random sphere of influence graph
• Multivariate normal approximation in geometric probability

zbMATH Keywords

Berry-Esseen boundsstabilizationPoisson functionalsforbidden region graph

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Cites Work

• Central limit theorems for some graphs in computational geometry.
• Title not available (Why is that?)
• Title not available (Why is that?)
• New Berry-Esseen bounds for functionals of binomial point processes
• Poisson process Fock space representation, chaos expansion and covariance inequalities
• A new method of normal approximation
• Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization
• Connected spatial networks over random points and a route-length statistic
• Normal approximation for coverage models over binomial point processes
• The expected size of some graphs in computational geometry
• A remainder term estimate for the normal approximation in classical occupancy

Cited In (2)

• Empty region graphs
• Normal approximation for stabilizing functionals

This page was built for publication: Bounds to the normal for proximity region graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743341)