The greedy walk on an inhomogeneous Poisson process
  The greedy walk is a deterministic walk that always moves from its current position to the nearest not yet visited point. In this paper we consider the greedy walk on an inhomogeneous Poisson point process on the real line. Our primary interest is whether the walk visits all points of the point process, and we determine sufficient and necessary conditions on the mean measure of the point process for this to happen. Moreover, we provide precise results on threshold functions for the property of visiting all points. 
Katja Gabrysch and Erik Th\"ornblad
math.PR