arXiv Analytics

Sign in

arXiv:1312.7862 [math.PR]AbstractReferencesReviewsResources

Phase transition for finite-speed detection among moving particles

Vladas Sidoravicius, Alexandre Stauffer

Published 2013-12-30Version 1

Consider the model where particles are initially distributed on $\mathbb{Z}^d, \, d\geq 2$, according to a Poisson point process of intensity $\lambda>0$, and are moving in continuous time as independent simple symmetric random walks. We study the escape versus detection problem, in which the target, initially placed at the origin of $\mathbb{Z}^d, \, d\geq 2$, and changing its location on the lattice in time according to some rule, is said to be detected if at some finite time its position coincides with the position of a particle. We consider the case where the target can move with speed at most 1, according to any continuous function and can adapt its motion based on the location of the particles. We show that there exists sufficiently small $\lambda_* > 0$, so that if the initial density of particles $\lambda < \lambda_*$, then the target can avoid detection forever.

Related articles: Most relevant | Search more
arXiv:0805.2652 [math.PR] (Published 2008-05-17, updated 2009-06-26)
Phase Transitions for the Groeth Rate of Linear Stochastic Evolutions
arXiv:0706.2106 [math.PR] (Published 2007-06-14)
The size of the largest component below phase transition in inhomogeneous random graphs
arXiv:math/0205237 [math.PR] (Published 2002-05-23, updated 2003-06-10)
The Random-Cluster Model