Many greedy cleaners in a Poisson environment

arXiv1910.01166MaRDI QIDQ6326434FDOQ6326434

Publication date: 2 October 2019

Abstract: We introduce a new ``greedy cleaning model where a star-like state space (containing N half-lines connected by the origin) is covered by a homogeneous Poisson process of ``dust particles, and N^{alpha} cleaners/workers proceed with cleaning in a ``greedy manner: each worker chooses the closest particle next. Assuming alpha in (0,1), we analyse the asymptotic behaviour of the workers, as N oinfty. We show that eventually all of them escape to infinity and that the way how do they do it depends on the value of alpha.

This page was built for publication: Many greedy cleaners in a Poisson environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326434)