Concentration for Poisson functionals: component counts in random geometric graphs

DOI10.1016/J.SPA.2015.11.004MaRDI QIDQ265636zbMATH OpenOpenAlexFDO

Authors Sascha Bachmann

Publication date 4 April 2016

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

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

zbMATH Keywords

concentration inequalitiescomponent countslogarithmic Sobolev inequalitiesPoisson point processrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05)

Abstract: Upper bounds for the probabilities $mathbbP(FgeqmathbbEF+r)$ and $mathbbP(FleqmathbbEF-r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process on $mathbb{R}^d$. The bounds for the upper tail decay exponentially, and the lower tail estimates even have a Gaussian decay. For the proof of the concentration inequalities, recently developed methods based on logarithmic Sobolev inequalities are used and enhanced. A particular advantage of this approach is that the resulting inequalities even apply in settings where the underlying Poisson process has infinite intensity measure.

Recommendations

• Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs
• Poisson convergence and Poisson processes with applications to random graphs
• Poisson convergence of numbers of vertices of a given degree in random graphs
• Two-point concentration in random geometric graphs
• Poisson convergence and semi-induced properties of random graphs
• Compound Poisson approximations of subgraph counts in random graphs
• scientific article; zbMATH DE number 5310725
• On the one dimensional Poisson random geometric graph
• Concentration and regularization of random graphs

Cites work

• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 1107555 (Why is no real title available?)
• A new modified logarithmic Sobolev inequality for Poisson point processes and several applications
• Concentration bounds for geometric Poisson functionals: logarithmic Sobolev inequalities revisited
• Concentration inequalities for functions of independent variables
• Concentration inequalities using the entropy method
• Concentration inequalities. A nonasymptotic theory of independence
• Fine Gaussian fluctuations on the Poisson space. I: Contractions, cumulants and geometric random graphs
• Fine Gaussian fluctuations on the Poisson space. II: Rescaled kernels, marked processes and geometric \(U\)-statistics
• Firefighting on a random geometric graph
• Infection spread in random geometric graphs
• Limit theorems for Betti numbers of random simplicial complexes
• On logarithmic Sobolev inequalities for continuous time random walks on graphs
• On modified logarithmic Sobolev inequalities for Bernoulli and Poisson measures
• On the one dimensional Poisson random geometric graph
• Probabilistic models in cluster analysis
• Random Geometric Graphs
• Random Plane Networks
• Random geometric complexes
• Random geometric complexes in the thermodynamic regime
• Simplicial homology of random configurations
• Some properties for the largest component of random geometric graphs with applications in sensor networks
• Station�re zuf�llige Ma�e auf lokalkompakten Abelschen Gruppen
• Stochastic and Integral Geometry
• Stochastic geometry for wireless networks
• The asymptotic distribution of random clumps
• Thresholding random geometric graph properties motivated by ad hoc sensor networks

Cited in

(8)

• Concentration bounds for geometric Poisson functionals: logarithmic Sobolev inequalities revisited
• Restricted hypercontractivity on the Poisson space
• Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs
• Concentration inequalities for Poisson point processes with application to adaptive intensity estimation
• A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
• Lower large deviations for geometric functionals
• Modified log-Sobolev inequalities, Beckner inequalities and moment estimates
• Gaussian fluctuations for edge counts in high-dimensional random geometric graphs

This page was built for publication: Concentration for Poisson functionals: component counts in random geometric graphs

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