The application of “concentration” steps is the main principle behind Forgy’s k-means algorithm and the fast-MCD algorithm. Despite this coincidence, it is not completely straightforward to combine both algorithms for developing a clustering method which is not severely affected by few...

The equivalence of sequences of probability measures jointly with the extension of Skorohod's representation theorem due to Blackwell and Dubins is used to obtain strong convergence of weighted sums of random elements in a separable Banach space. Our results include most of the known work on...