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

The estimates for subgraph counts follow from tail inequalities for more general local Poisson U-statistics. These bounds are proved using recent general concentration results for Poisson U-statistics and techniques involving the convex distance for Poisson processes.