23/11/2022, 16:00 — 17:00 — Online
Thomas Mountford, École Polytechnique Fédérale de Lausanne
Greedy cleaning of Poisson dust on French railway
We consider a system of N half lines issuing from the origin, on which there is a Poisson process of dust particles initially. We have N^ \alpha workers who clean dust particles according to a greedy algorithm; they move to the closest dust particle and remove it and then wait an exponential time before chosing a new particle. We consider for which values of alpha one can have half lines where two or more workers go to infinity. The talk uses only elementary probability arguments and well known properties of Poisson processes. It should be accessible to all.
Joint with Sergey Foss and Takis Konstantopoulous
