Limit theory for the Gilbert graph
classification
🧮 math.PR
keywords
distancegraphpoissonconcentrationgilbertlimitparameterpoint
read the original abstract
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random geometric graph, is investigated as the intensity of the Poisson point process is increased and the distance parameter goes to zero. The asymptotic expectation and covariance structure of a class of length-power functionals are computed. Distributional limit theorems are derived that have a Gaussian, a stable or a compound Poisson limiting distribution. Finally, concentration inequalities are provided using a concentration inequality for the convex distance.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.