![](https://d3ilqtpdwi981i.cloudfront.net/fZMKl89kBrktTs79EIJcYhMLSC8=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/57/c7/ba/57c7ba19-f9f1-42db-84c3-b03a72183228/thumbnail_e8a9e147-1693-4d0c-abdd-a187f6771aae.jpg)
- Poisson process,
- coverage,
- partition
Let P be a Poisson process of intensity one in the infinite plane R2. We surround each point x of P by the open disc of radius r centred at x. Now let Sn be a fixed disc of area n, and let Cr(Sn) be the set of discs which intersect Sn. Write Erk for the event that Cr(Sn) is a k-cover of Sn, and Frk for the event that Cr(Sn) may be partitioned into k disjoint single covers of Sn. We prove that P(Erk ∖ Frk) ≤ ck / logn, and that this result is best possible. We also give improved estimates for P(Erk). Finally, we study the obstructions to k-partitionability in more detail. As part of this study, we prove a classification theorem for (deterministic) covers of R2 with half-planes that cannot be partitioned into two single covers.
This is the authors' version of the paper. The publisher's version is here: http://projecteuclid.org/euclid.aap/1269611141
This is the authors' version of the paper. The publisher's version is here: http://projecteuclid.org/euclid.aap/1269611141