Poisson approximation in connection with clustering of random points (Q1305421): Difference between revisions

Let \(n\) particles be independently and uniformly distributed in a rectangle \({\mathbf A}\subset\mathbb{R}\). The number of \(k\) subsets of particles which are actually covered by some translate of a given convex set \({\mathbf A}\subset{\mathbf C}\) is denoted by \(W\). The positions of such subsets constitute a point process on \({\mathbf A}\). Each point of this process can be marked with the smallest necessary ``size'' of a set, of the same shape and orientation as \(C\), which covers the particles determining the point. This paper considers Poisson (process) approximations of \(W\) and of the above point process, by way of Stein's method.