On the length of the longest excursion

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Summary

A lower limit of the length of the longest excursion of a symmetric random walk is given. Certain related problems are also discussed. It is shown e.g. that for any ɛ>0 and all sufficiently large n there are c(ɛ) loglog n excursions in the interval (0, n) with total length greater than n(1−ɛ), with probability 1.