In this thesis, new methods for proving concentration inequalities for Poisson functionals are developed. The focus is on techniques that are based on logarithmic Sobolev inequalities, but also results that are based on the convex distance for Poisson processes are presented. The general methods are applied to a variety of functionals associated with random geometric graphs. In particular, concentration inequalities for subgraph and component counts are proved. Finally, the established concentration results are used to derive strong laws of large numbers for subgraph and component counts associated with random geometric graphs.
| Identifer | oai:union.ndltd.org:uni-osnabrueck.de/oai:repositorium.ub.uni-osnabrueck.de:urn:nbn:de:gbv:700-2016011313874 |
| Date | 13 January 2016 |
| Creators | Bachmann, Sascha |
| Contributors | Prof. Dr. Matthias Reitzner, Prof. Dr. Peter Eichelsbacher |
| Source Sets | Universität Osnabrück |
| Language | English |
| Detected Language | English |
| Type | doc-type:doctoralThesis |
| Format | application/pdf, application/zip |
| Rights | http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0022 seconds