Concentration for Poisson U-statistics: Subgraph counts in random geometric graphs

Sascha Bachmann and Matthias Reitzner

Stochastic Processes and their Applications, 2018, vol. 128, issue 10, 3327-3352

Abstract: Concentration bounds for the probabilities P(N≥M+r) and P(N≤M−r) are proved, where M is a median or the expectation of a subgraph count N associated with a random geometric graph built over a Poisson process. The lower tail bounds have a Gaussian decay and the upper tail inequalities satisfy an optimality condition. A remarkable feature is that the underlying Poisson process can have a.s. infinitely many points.

Keywords: Random graphs; Subgraph counts; Concentration inequalities; Stochastic geometry; Poisson point process; Convex distance (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414917302776
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:128:y:2018:i:10:p:3327-3352

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spa.2017.11.001

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().