Gaussian fluctuations for edge counts in high-dimensional random geometric graphs

DOI10.1016/J.SPL.2019.108674MaRDI QIDQ2288829zbMATH OpenOpenAlexFDO

Authors Jens Grygierek, Christoph Thäle

Publication date 20 January 2020

Published in Statistics \& Probability Letters (Search for Journal in Brave)

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

zbMATH Keywords

central limit theoremedge counting statistichigh dimensional random geometric graphPoisson point processsecond-order Poincaré inequalitystochastic geometry

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05)

Abstract: Consider a stationary Poisson point process in $mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric graph. The number of edges of this graph is counted that have midpoint in the $d$-dimensional unit ball. A quantitative central limit theorem for this counting statistic is derived, as the space dimension $d$ and the intensity of the Poisson point process tend to infinity simultaneously.

Recommendations

• Probabilistic properties of highly connected random geometric graphs
• Probabilistic properties of highly connected random geometric graphs
• Higher-order fluctuations in dense random graph models
• High-dimensional random geometric graphs and their clique number
• Limit theory of sparse random geometric graphs in high dimensions
• Connectivity of random high dimensional geometric graphs
• Fluctuations of subgraph counts in graphon based random graphs
• Random graphs, geometry and asymptotic structure
• Large deviations for empirical measures of generalized random graphs
• Concentration for Poisson functionals: component counts in random geometric graphs

Cites work

• Central limit theorems for \(U\)-statistics of Poisson point processes
• High-dimensional random geometric graphs and their clique number
• Limit theory for the Gilbert graph
• Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization
• Random Geometric Graphs
• Stochastic analysis for Poisson point processes. Malliavin calculus, Wiener-Itô chaos expansions and stochastic geometry
• Testing for high-dimensional geometry in random graphs

Cited in

(12)

• Higher-order fluctuations in dense random graph models
• Phase transitions for detecting latent geometry in random graphs
• Limit theory for the Gilbert graph
• Fine Gaussian fluctuations on the Poisson space. I: Contractions, cumulants and geometric random graphs
• High-dimensional random geometric graphs and their clique number
• Information and dimensionality of anisotropic random geometric graphs
• Poisson and Gaussian fluctuations for the components of the \(\mathbf{f}\)-vector of high-dimensional random simplicial complexes
• Functional central limit theorem for subgraph counting processes
• Random geometric graph: some recent developments and perspectives
• Limit theory of sparse random geometric graphs in high dimensions
• Quantitative CLTs on the Poisson space via Skorohod estimates and p-Poincaré inequalities
• Intersections of Poisson k-flats in hyperbolic space: completing the picture

This page was built for publication: Gaussian fluctuations for edge counts in high-dimensional random geometric graphs

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