Asymptotics for geometric location problems over random samples (Q4944083)

The purpose of this paper is to investigate the basic location problem in which locations from among \(n\) given points \(x_1,\dots, x_n\) are to be chosen so as to minimize the sum \(M(k; x_1,\dots, x_n)\) of the distances of each point to the nearest location. It is assumed that no location can serve more than a fixed finite number \(D\) of points. If \(x_i\), \(i\geq 1\), are i.i.d. random variables with values in \([0,1]^d\) and if \(k= \lceil n/(D+ 1)\rceil\), the authors prove that \[ \lim_{n\to\infty} M(k; x_1,\dots, x_n)/n^{(d- 1)/d}= \alpha \int_{[0,1]^d} f(x)^{(d- 1)/d} dx\qquad \text{c.c.}, \] where \(\alpha:= \alpha(D,d)\) is a positive constant, \(f\) is the density of the absolutely continuous part of the law of \(x_1\) and c.c. denotes complete convergence.