Gabrysch, Katja Distribution of the smallest visited point in a greedy walk on the line. (English) Zbl 1351.60060 J. Appl. Probab. 53, No. 3, 880-887 (2016). Summary: We consider a greedy walk on a Poisson process on the real line. It is known that the walk does not visit all points of the process. In this paper we first obtain some useful independence properties associated with this process which enable us to compute the distribution of the sequence of indices of visited points. Given that the walk tends to \(+\infty\), we find the distribution of the number of visited points in the negative half-line, as well as the distribution of the time at which the walk achieves its minimum. Cited in 1 Document MSC: 60G55 Point processes (e.g., Poisson, Cox, Hawkes processes) 60K35 Interacting random processes; statistical mechanics type models; percolation theory Keywords:Poisson point process; greedy walk × Cite Format Result Cite Review PDF Full Text: DOI