Concentration for Poisson functionals: Component counts in random geometric graphs

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.