Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published November 28, 2002 | public
Journal Article

A random stacking process


We examine a generalization of one-dimensional random walks with one reflecting and one absorbing boundary, in which a range of strategies is available, and the goal is to avoid absorption for as long as possible; we show a sharp threshold for the walk parameter separating linear and exponential expected walk times.

Additional Information

© 2002 Elsevier. Received 6 November 2000, Revised 2 May 2001, Accepted 2 May 2001, Available online 20 September 2002. In honor of Daniel J. Kleitman on the occasion of his 65th birthday. Supported in part by NSF CAREER grant 9876172/0049092 and the Charles Lee Powell Foundation. Thanks to the anonymous referees for helpful comments.

Additional details

September 28, 2023
October 24, 2023